Minimizing total completion time in two-machine flow shops with exact delays

Computers and Operations Research

Volumn 36, Issue 6, 2009, Pages 2018-2030

  Huo, Yumei ^a   Li, Haibing ^b   Zhao, Hairong ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b LEHMAN BROTHERS   (United States)

^c PURDUE UNIVERSITY CALUMET   (United States)

Author keywords

Exact delay; Flow shop; Metaheuristics; NP hard; Permutation schedule; Total completion time

Indexed keywords

MACHINE SHOP PRACTICE; NUCLEAR PROPULSION;

EXACT DELAY; FLOW SHOP; METAHEURISTICS; NP-HARD; PERMUTATION SCHEDULE; TOTAL COMPLETION TIME;

MACHINE SHOPS;

EID: 56549108207     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.06.015     Document Type: Article

References (20)

1. Ageev AA, Kononov AV. Approximation algorithms for scheduling problems with exact delays. In: Proceedings of the fourth international workshop, WAOA 2006, Zurich, Switzerland; 2006. p. 1-14.
2. Van Deman J.M., and Baker K.R. Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Transactions 6 (1974) 28-34
3. Röck H. Some new results in flow shop scheduling. Mathematical Methods of Operations Research (ZOR) 28 1 (1984) 1-16
4. Gonzales T. Unit execution time shop problems. Mathematics of Operations Research 7 (1982) 57-66
5. Sriskandarajah C., and Ladet P. Some no-wait shops scheduling problems: complexity aspects. European Journal of Operational Research 24 3 (1986) 424-438
6. Rajendran C., and Chaudhuri D. Heursitic algorithms for continuous flow-shop problem. Naval Research Logistics 37 (1990) 695-705
7. Chen C.L., Neppalli R.V., and Aljaber N. Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering 30 (1996) 919-929
8. Fink A., and Voß S. Solving the continuous flow-shop scheduling problem by mata-heuristics. European Journal of Operational Research 151 (2003) 400-414
9. Adiri I., and Pohoryles D. Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly 29 (1982) 495-504
10. Gupta J.N.D. Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics Quarterly 23 (1976) 235-243
11. Papadimitriou C.H., and Kanellakis P.C. Flowshop scheduling with limited temporary storage. Journal of the Association of Computing Machinery 27 (1980) 533-549
12. Szwarc W. A note on the flow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly 28 (1981) 665-669
13. Van der Veen J.A.A., and Van Dal R. Solvable cases of the no-wait flow-shop scheduling problem. Journal of the Operational Research Society 42 (1991) 971-980
14. Yu W., Hoogeveen H., and Lenstra J.K. Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling 7 (2004) 333-348
15. Yu W. The two-machine flow shop problem with delays and the one-machine total tardiness problem. Dissertation, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 1996.
16. Leung J., Li H., and Zhao H. Scheduling two-machine flow shops with exact delay. International Journal of Foundations of Computer Science 18 2 (2007) 341-360
17. Ageev A.A., and Kononov A.V. Approximation algorithms for the single and two-machine scheduling problems with exact delays. Operations Research Letters 35 4 (2007) 533-540
18. Graham R.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequence and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
19. Glover F. Tabu search-part II. ORSA Journal on Computing 2 (1990) 4-32
20. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 4598 (1983) 671-680