Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 69, Issue 3, Pages 323-338Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0925-5273(00)00039-6
Keywords
flowshop scheduling; hierarchical criteria; dominance conditions; heuristic algorithms; empirical evaluation
Ask authors/readers for more resources
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. Based on the analysis of the problem characteristics, several existing results are extended to develop two optimization algorithms for the problem. In view of the NP-hardness of the problem, two polynomially solvable cases are identified and solved. Further, several polynomial heuristic solution algorithms are developed and empirically evaluated as to their effectiveness in finding an optimal schedule for the problem. (C) 2001 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available