Two-stage open shop scheduling with a bottleneck machine

European Journal of Operational Research

Volumn 128, Issue 1, 2001, Pages 159-174

  Drobouchevitch, Inna G ^a   Strusevich, Vitaly A ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; JOB ANALYSIS;

BOTTLENECK MACHINE; HEURISTIC ALGORITHMS; TWO-STAGE OPEN SHOP SCHEDULING;

SCHEDULING;

EID: 0035192746     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00356-2     Document Type: Article

References (12)

1. V.A. Aksjonov, A polynomial-time algorithm of approximate solution of a scheduling problem. Upravlyaemye Sistemy 28 (1988) 8-11 (in Russian).
2. I. Bárány, T. Fiala, Nearly optimum solution of multimachine scheduling problems. Szigma 15 (1982) 177-191 (in Hungarian).
3. Chen B., Strusevich V.A. Approximation algorithms for three machine open shop scheduling. ORSA Journal on Computing. 5:1993;321-326.
4. Chen B., Strusevich V.A. Worst-case analysis of heuristics for open shops with parallel machines. European Journal of Operational Research. 70:1993;379-390.
5. I.G. Drobouchevitch, V.A. Strusevich, A polynomial algorithm for the three-machine open shop with a bottleneck machine, Annals of Operations Research, to appear.
6. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. Journal of the Association of Computing Machinery. 23:1976;665-679.
7. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 455-522.
8. P. Schuurman, G.J. Woeginger, Approximation algorithms for the multiprocessor open shop problem, Report Woe-13, TU Graz, Austria, 1997.
9. Sevastianov S.V., Woeginger G.J. Makespan minimization in open shops: A polynomial time approximation scheme. Mathematical Programming. 82:1998;191-198.
10. Strusevich V.A., Hall L.A. An open shop scheduling problem with a non-bottleneck machine. Operations Research Letters. 21:1997;11-18.
11. J.M. Wein, Algorithms for scheduling and network problems, Ph.D. Thesis, Cambridge, USA, 1991.
12. Williamson D.P., Hall L.A., Hoogeveen J.A., Hurkens C.A.J., Lenstra J.K., Sevast'janov S.V., Shmoys D.B. Short shop schedules. Operations Research. 45:1997;288-294.