Scheduling two-machine flow shops with exact delays

International Journal of Foundations of Computer Science

Volumn 18, Issue 2, 2007, Pages 341-359

  Leung, Joseph Y T ^a   Li, Haibing ^b   Zhao, Hairong ^c  

^a University Heights   (United States)

^b FlexTrade Systems Inc   (United States)

^c PURDUE UNIVERSITY CALUMET   (United States)

Author keywords

Approximation algorithm; Exact delay; Flow shop; Makespan; NP hard; Total completion time

Indexed keywords

EID: 34247241650     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054107004711     Document Type: Conference Paper

References (34)

1. N. Bansal, M. Mahdian and M. Sviridenko. Minimizing makespan in no-wait job shops. Mathematics of Operations Research, 30: 817-831, 2005.
2. J.L.Bouquard, J.C. Billaut, M.A. Kubzin and V.A. Strusevich. Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letters, 33: 255-262, 2005.
3. J.L.Bouquard, C. Lenté. Two-machine flow shop scheduling problems with mimimal and maximal delays. 4OR, 4: 15-28, 2006.
4. R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen and G.J. Woeginger. Well-solvable special cases of the traveling salesman problem: A survey. SIAM Review, 40: 496-546, 1998.
5. C.L. Chen, R.V. Neppalli and N. Aljaber. Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering, 30: 919-929, 1996.
6. M. Dell'Amico. Shop problems with two machines and time lags. Operations Research, 44: 777-787, 1996.
7. M. Dell'Amico and R.J.M. Vaessens. Flow and open shop scheduling on two machines with transportation times and machine-independent processing times is NP-hard, Material di discussione 141, Dipartimento di Economia Politica, Università di Modena, 1996.
8. J.Fondrevelle, A. Oulamara and M.C. Portmann. Permutation flowshop scheduling problem with maximal and minimal time lags. Computers and Operations Research, 33: 1540-1556, 2006.
9. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
10. P. Gilmore and R. Gomory. Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research, 12: 655-679, 1964.
11. P.C.Gilmore, E.L. Lawler and D.B. Shmoys. Well solved cases, in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (Eds), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, New York, pp. 87-143, 1986.
12. C.A. Glass, J.N.D. Gupta and C.N. Potts. Two-machine no-wait flow shop scheduling with missing operations. Mathematics of Operations Research, 24: 911-924, 1999.
13. R.L. Graham, J.K. Lenstra and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5: 287-326, 1979.
14. N. Hall and C. Sriskandarajah. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44: 510-525, 1996.
15. W. Kern and W.M. Nawijn. Scheduling multi-operation jobs with time lags on a single machine. Proceedings 2nd Twente Workshop on Graphs and Combinatorial Optimization, U. Faigle and C. Hoede (eds.), Enschede, 1991.
16. M.A. Kubzin and V.A. Strusevich. Two-machine flow shop no-wait scheduling with machine maintenance. 4OR, 3: 303-313, 2005.
17. J.K. Lenstra. Private communication, 1991.
18. J.Y-T. Leung and H. Zhao Minimizing sum of completion times and makespan in master-slave systems IEEE Transactions on Computers, 55: 985-999,2006.
19. L.G. Mitten. Sequence n jobs on two machines with arbitrary time lags. Management Science, 5: 293-298, 1958.
20. A.J. Orman and C.N. Potts. On the complexity of coupled-task scheduling. Discrete Applied Mathematics, 72: 141-154, 1997.
21. J. Peihler. Ein beitrag zum reihenfolge problem. Unternehmensforschung, 4: 138-142, 1960.
22. C. Rajendran and D. Chaudhuri. Heursitic algorithms for continuos flow-shop problem. Naval Research Logistics, 37: 695-705, 1990.
23. H. Röck. Some new results in flow shop scheduling. Mathematical Methods of Operations Research (ZOR), 28: 1-16, 1984.
24. H. Röck. The three-machine no-wait flow shop is NP-complete. Journal of the Association for Computing Machinary, 31: 336-345, 1984.
25. H. Röck and G. Schmidt. Machine aggregation heuristics in shop scheduling. Methods of Operations Research, 45: 303-314, 1983.
26. S. Sahni and Y. Cho. Complexity of scheduling shops with no-wait in process. Mathematics of Operations Research, 4: 448-457, 1979.
27. M. Sviridenko. Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. SIAM Journal on Discrete Mathematics, 16: 313-322, 2003.
28. J.M. van Deman and K.R. Baker. Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Transactions, 6: 28-34, 1974.
29. G.L. Vairaktarakis. Simple algorithms for Gilmore-Gomory's traveling salesman and related problems. Journal of Scheduling, 6: 499-520, 2003.
30. D.A. Wismer. Solution of the flow shop scheduling problem with no intermediate queues. Operations Research, 20: 689-697, 1972.
31. G.J. Woeginger. Inapproximability results for no-wait job shop scheduling. Operations Research Letters, 32: 320-325, 2004.
32. D.L. Yang and M.S. Chern. A two-machine flowshop sequencing problem with limited waiting time constraints. Computers and Industrial Engineering, 28: 63-70, 1995.
33. W. Yu. The Two-Machine Flow Shop Problem with Delays and the One-Machine Total Tardiness Problem, PhD Thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, 1996.
34. W. Yu, H. Hoogeveen and J.K. Lenstra. Minimizing makespan in a two-machine flow shop with delays and unit- time operations is NP-hard. Journal of Scheduling, 7: 333-348, 2004.