Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 455-465

  Jansen, Klaus ^a   Sviridenko, Maxim I ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION DISSEMINATION; MACHINE SHOP PRACTICE; MULTIPROCESSING SYSTEMS; SCHEDULING;

FLOW SHOP SCHEDULING PROBLEM; IDENTICAL MACHINES; MAKESPAN; MULTI STAGE; NON-PREEMPTIVE; OPEN SHOP; POLYNOMIAL TIME APPROXIMATION SCHEMES;

POLYNOMIAL APPROXIMATION;

EID: 84944067702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_38     Document Type: Conference Paper

References (15)

1. B. Chen, Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage, Journal of the Operational Research Society 46 (1995), 234-244.
2. B. Chen and V.A. Strusevich, Worst case analysis of heuristics for open shops with parallel machines, European Journal of Operational Research 70 (1993), 379-390.
3. M.R. Garey and D.S. Johnson, Strong NP-completeness results: Motivation, examples and implications, Journal of the ACM 25 (1978), 499-508.
4. M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1 (1976), 117-129.
5. T. Gonzales and S. Sahni, Open shop scheduling to minimize finish time, Journal of the ACM 23 (1976), 665-679.
6. L.A. Hall, Approximability of flow shop scheduling, Proceedings of the 36th An- nual IEEE Symposium on Foundations of Computer Science (1995), 82-91 and Mathematical Programming 82 (1998), 175-190.
7. D.S. Hochbaum and D.B. Shmoys, Using dual approximation algorithms for scheduling problems: theoretical and practical results, Journal of the ACM 34 (1987), 144-162.
8. J.A. Hoogeveen, J.K. Lenstra and B. Veltman, Preemptive scheduling in a twostage multiprocessor flow shop is NP-hard, European Journal of Operational Re- search 89 (1996), 172-175.
9. K. Jansen, R. Solis-Oba and M.I. Sviridenko, Makespan minimization in job shops: a polynomial time approximation scheme, Proceedings of the 31th Annual ACM Symposium on Theory of Computing, to appear, 1999.
10. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbook in Operations Research and Management Science, Vol. 4, North-Holland, 1993, 445-522.
11. P. Schuurman and G.J. Woeginger, Approximation algorithms for the multiprocessor open shop scheduling problem, Operations Research Letters, to appear.
12. P. Schuurman and G.J. Woeginger, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Theoretical Computer Science, to appear.
13. S.V. Sevastianov and G.J. Woeginger, Makespan minimization in open shops: A polynomial time approximation scheme, Mathematical Programming 82 (1998), 191-198.
14. C. Sriskandarajah and S.P. Sethi, Scheduling algorithms for flexible flow shops: worst and average case performance, European Journal of Operational Research 43 (1989), 143-160.
15. 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, Operations Research 45 (1997), 288-294.