Makespan minimization in open shops: A polynomial time approximation scheme

Mathematical Programming, Series B

Volumn 82, Issue 1-2, 1998, Pages 191-198

  Sevastianov, Sergey V ^a   Woeginger, Gerhard J ^b,c  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation algorithm; Approximation scheme; Makespan; Open shop; Scheduling; Worst case analysis

Indexed keywords

EID: 0001353081     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01585871     Document Type: Article

References (13)

1. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in Handbooks in Operations Research and Management Science, vol. 4, North Holland, Amsterdam, 1993, pp. 445-522.
2. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, Journal of the Association of Computing Machinery 23 (1976) 665-679.
3. I. Bárány, T. Fiala, Nearly optimum solution of multimachine scheduling problems, Szigma Mathematika Közgazdasági Folyóirat 15 (1982) 177-191 (in Hungarian).
4. V.A. Aksjonov, A polynomial-time algorithm for an approximate solution of a scheduling problem, Upravlyaemye Sistemy 28 (1988) 8-11 (in Russian).
5. B. Chen, V.A. Strusevich, Approximation algorithms for three-machine open shop scheduling, ORSA Journal on Computing 5 (1993) 321-326.
6. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevastianov, D.B. Shmoys, Short shop schedules, Operations Research, 45 (1997) 288-294.
7. D.B. Shmoys, C. Stein, J. Wein, Improved approximation algorithms for shop scheduling problems, SIAM Journal on Computing 23 (1994) 617-632.
8. J.P. Schmidt, A. Siegel, A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence, SIAM Journal on Discrete Mathematics 8 (1995) 223-250.
9. L.A. Hall, Approximability of flow shop scheduling, Mathematical Programming (this issue).
10. D.S. Hochbaum, D.B. Shmoys, Using dual approximation algorithms for scheduling problems: theoretical and practical results, Journal of the Association of Computing Machinery 34 (1987) 144-162.
11. L.A. Hall, D.B. Shmoys, Approximation algorithms for constrained scheduling problems, in: Proceedings of 30th IEEE Symposium on Foundations of Computer Science, 1989, pp. 134-139.
12. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, CA, 1979.
13. T. Fiala, An algorithm for the open-shop problem, Mathematics of Operations Research 8 (1983) 100-109.