Makespan minimization in no-wait flow shops: A polynomial time approximation scheme

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 2, 2003, Pages 313-322

  Sviridenko, M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Shop scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; HAMILTONIANS; JOB ANALYSIS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; SCHEDULING; THEOREM PROVING;

APPROXIMATION ALGORITHM; MAKESPAN MINIMIZATION; NO WAIT FLOW SHOP PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEME; SHOP SCHEDULING;

TRAVELING SALESMAN PROBLEM;

EID: 0038813891     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100370803     Document Type: Article

References (25)

1. A. Agnetis, No-wait flow shop scheduling with large lot sizes, Ann. Oper. Res., 70 (1997), pp. 415-438.
2. B. Carr and S. Vempala, Towards a 4/3 approximation for the asymmetric traveling salesman problem, in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2000, pp. 116-125.
3. S.S. Cosmadakis and C.H. Papadimitriou, The traveling salesman problem with many visits to few cities, SIAM J. Comput., 13 (1984), pp. 99-108.
4. A. Frieze, G. Galbiati, and F. Maffioli, On the worst case performance of some algorithms for the asymmetric traveling salesman problem, Networks, 12 (1982), pp. 23-39.
5. P. Gilmore and R. Gomory, Sequencing a one state-variable machine: A solvable case of the traveling salesman problem, Oper. Res., 12 (1964), pp. 655-679.
6. C. Glass, J.N.D. Gupta, and C.N. Potts, Two-machine no-wait flow shop scheduling with missing operations, Math. Oper. Res., 24 (1999), pp. 911-924.
7. L.A. Hall, Approximability of flow shop scheduling, Math. Programming, 82 (1998), pp. 175-190.
8. N. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Oper. Res., 44 (1996), pp. 510-525.
9. K. Jansen, R. Solis-Oba, and M. Sviridenko, Makespan minimization in job shops: A polynomial time approximation scheme, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1999, pp. 394-399.
10. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Process. Lett., 37 (1991), pp. 27-35.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, S. Graves, A.H.G. Rinnooy Kan, and P. Zipkin, eds., North-Holland, Amsterdam, 1993, pp. 445-522.
12. C.H. Papadimitriou and P. Kanellakis, Flow-shop scheduling with limited temporary storage, J. ACM, 27 (1980), pp. 533-549.
13. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
14. C.H. Papadimitriou and S. Vempala, On the approximability of the traveling salesman problem, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2000, pp. 126-133.
15. J. Piehler, Ein beitrag zum reihenfolgeproblem, Unternehmensforschung, 4 (1960), pp. 138-142.
16. H. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Oper. Res., 28 (1980), pp. 1347-1359.
17. H. Röck, The three-machine no-wait flow shop is NP-complete, J. ACM, 31 (1984), pp. 336-345.
18. H. Röck and G. Schmidt, Machine aggregation heuristics in shop-scheduling, Methods Oper. Res., 45 (1993), pp. 303-314.
19. S. Sahni and Y. Cho, Complexity of scheduling shops with no wait in process, Math. Oper. Res., 4 (1979), pp. 448-457.
20. S.V. Sevastianov and G.J. Woeginger, Makespan minimization in open shops: A polynomial time approximation scheme, Math. Programming, 82 (1998), pp 191-198.
21. J.B. Sidney, C.N. Potts, and C. Sriskandarajah, A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups, Oper. Res. Lett., 26 (2000), pp. 165-173.
22. J.B. Sidney and C. Sriskandarajah, A heuristic for the two-machine no-wait open shop scheduling problem, Naval Res. Logist., 46 (1999), pp. 129-145.
23. M. Sviridenko and G.J. Woeginger, Approximability and in-approximability results for no-wait shop scheduling, in Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, IEEE, Los Alamitos, CA, 2000, pp. 116-125.
24. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevastianov, and D.B. Shmoys, Short shop schedules, Oper. Res., 45 (1997), pp. 288-294.
25. D.A. Wismer, Solution of the flow shop scheduling problem with no intermediate queues, Oper. Res., 20 (1972), pp. 689-697.