Article ID: | iaor20081230 |
Country: | Netherlands |
Volume: | 182 |
Issue: | 1 |
Start Page Number: | 947 |
End Page Number: | 954 |
Publication Date: | Nov 2006 |
Journal: | Applied Mathematics and Computation |
Authors: | Wang Ji-Bo, Shan Feng, Jiang Bo, Wang Li-Yan |
Keywords: | flowshop |
This paper deals with some special cases of general, no-wait and no-idle permutation flow shop scheduling problems, respectively. Special cases means that the machines form an increasing series of dominant machines, a decreasing series of dominant machines, an increasing–decreasing series of dominant machines and a decreasing–increasing series of dominant machines. Efficient polynomial time algorithms for finding the optimal schedules to minimize discounted total weighted completion time are developed.