97-21
Minimizing Total Flow Time in a Two-Machine Flowshop Problem with Minimum Makespan
by Gupta, J.N.D.; Neppalli, V.R.; Werner, F.
Preprint series: 97-21, Preprints
The paper is published: International Journal of Production Economics 69, 2001, 323 - 338.
Abstract: This paper considers the two-machine flowshop scheduling problem where it is desired to find a minimum total flow time schedule subject to the condition that the makespan of the schedule is minimum. In view of the NP-hardness of the problem, two polynomially solvable cases are identified and solved. Based on the analysis of the problem characteristics, several existing results are extended to develop two optimization algorithms for the problem. Further, several polynomial heuristic solution algorithms are developed and empirically evaluated as to their effectiveness in finding an optimal schedule for the problem.
Keywords: flowshop scheduling, hierarchical criteria, dominance conditions,heuristic algorithms, empirical evaluation
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.