Inapproximability results for no-wait job shop scheduling

Operations Research Letters

Volumn 32, Issue 4, 2004, Pages 320-325

  Woeginger, Gerhard J ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

Approximation algorithms; APX hardness; Shop scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; SCHEDULING; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; APX HARDNESS; SHOP SCHEDULING;

OPERATIONS RESEARCH;

EID: 2042472835     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.10.003     Document Type: Article

References (16)

1. Gilmore P., Gomory R. Sequencing a one state-variable machine. a solvable case of the traveling salesman problem Oper. Res. 12:1964;655-679.
2. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. a survey Ann. of Discrete Math. 5:1979;287-326.
3. Hall L.A. Approximability of flow shop scheduling. Math. Programming. 82:1998;175-190.
4. Hall N., Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44:1996;510-525.
5. K. Jansen, R. Solis-Oba, M. Sviridenko, Makespan minimization in job shops: a polynomial time approximation scheme, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, (STOC'1999), Atlanta, USA, 1999, pp. 394-399.
6. Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Process. Lett. 37:1991;27-35.
7. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Eds.), Handbooks in Operations Research and Management Science, Logistics of Production and Inventory, Vol. 4, North-Holland, Amsterdam, 1993, pp. 445-522.
8. Petrank E. The hardness of approximation. gap location Comput. Complexity. 4:1994;133-157.
9. Röck H. The three-machine no-wait flow shop is NP-complete. J. ACM. 31:1984;336-345.
10. Röck H., Schmidt G. Machine aggregation heuristics in shop-scheduling. Methods Oper. Res. 45:1983;303-314.
11. Sahni S., Cho Y. Complexity of scheduling shops with no wait in process. Math. Oper. Res. 4:1979;448-457.
12. Sevastianov S.V., Woeginger G.J. Makespan minimization in open shops. a polynomial time approximation scheme Math. Programming. 82:1998;191-198.
13. Sidney J.B., Sriskandarajah C. A heuristic for the two-machine no-wait open shop scheduling problem. Nav. Res. Logistics. 46:1999;129-145.
14. Sviridenko M. Makespan minimization in no-wait flow shops. a polynomial time approximation scheme SIAM J. Discrete Math. 16:2003;313-322.
15. M. Sviridenko, G.J. Woeginger, Approximability and inapproximability results for no-wait shop scheduling, Proceedings of the 41st IEEE Symposium on the Foundations of Computer Science (FOCS'2000), Redondo Beach, USA, 2000, pp. 116-125.
16. Williamson D.P., Hall L.A., Hoogeveen J.A., Hurkens C.A.J., Lenstra J.K., Sevastianov S.V., Shmoys D.B. Short shop schedules. Oper. Res. 45:1997;288-294.