Transportation Time In Optimal Due-date Determination and Minimization of a Lateness Cost Function in a Special Class of n-Jobs, 3- machines Sequencing Problem

Abstract

This paper provides a heuristic algorithm for n- jobs and 3- machines sequencing problem involving processing times and transportation time. A heuristic approach is given to nd optimal sequence, minimizing the squared value of lateness cost function. This approach is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule for ow-shop scheduling problems. The method is clari ed with the help of numerical illustration. Finally, we identify and suggest some worthwhile areas for further research.