Approximability and in-approximability results for no-wait shop scheduling

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 116-125

  Sviridenko, Maxim ^a   Woeginger, Gerhard J ^b  

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

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING;

NO-WAIT SHOP SCHEDULING; POLYNOMIAL TIME APPROXIMATION METHODS;

COMPUTER SCIENCE;

EID: 0034504506     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892071     Document Type: Article

References (24)

1. A. Agnetis No-wait flow shop scheduling with large lot sizes Annals of Operations Research 70 415 438 1997
2. B. Carr S. Vempala Towards a 4/3 approximation for the asymmetric traveling salesman problem Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA'2000) 116 125 Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA'2000) 2000
3. S. Cosmadakis C.H. Papadimitriou The traveling salesman problem with many visits to few cities SIAM Journal of Computing 13 99 108 1984
4. A. Frieze G. Galbiati F. Maffioli On the worst case performance of some algorithms for the asymmetric traveling salesman problem Networks 12 23 39 1982
5. P. Gilmore R. Gomory Sequencing a one state-variable machine: A solvable case of the traveling salesman problem Operations Research 12 655 679 1964
6. C. Glass J.N.D. Gupta C.N. potts Two-machine no-wait flow shop scheduling with missing operations Mathematics of Operations Research 24 911 924 1999
7. L.A. Hall Approximability of flow shop scheduling Mathematical Programming 82 175 190 1998
8. N. Hall C. Sriskandarajah A survey of machine scheduling problems with blocking and no-wait in process Operations Research 44 510 525 1996
9. K. Jansen R. SOLIS-OBA M. Sviridenko Makespan minimization in job shops: a polynomial time approximation scheme Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC'1999) 394 399 Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC'1999) 1999
10. V. Kann Maximum bounded 3-dimensional matching is MAX SNP-complete Information Processing Letters 37 27 35 1991
11. E.L. Lawler J.K. Lenstra A.H.G. R. Kan D.B. Shmoys Handbooks in Operations Research and Management Science 4 445 522 1993 North Holland Amsterdam Sequencing and scheduling: algorithms and complexity
12. C.H. Papadimitriou P. Kanellakis Flow-shop scheduling with limited temporary storage Journal of the ACM 27 533 549 1980
13. C.H. Papadimitriou K. Steiglitz Combinatorial optimization: algorithms and complexity 1982 Prentice Hall New Jersey
14. C.H. Papadimitriou S. Vempala On the approximability of the traveling salesman problem Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'2000) Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'2000) 2000
15. E. Petrank The hardness of approximation: gap location Computational Complexity 4 133 157 1994
16. H. Psaraftis A dynamic programming approach for sequencing groups of identical jobs Operations Research 28 1347 1359 1980
17. H. Röck The three-machine no-wait flow shop is NP-complete Journal of the ACM 31 336 345 1984
18. H. Röck G. Schmidt Machine aggregation heuristics in shop-scheduling Methods of Operations Research 45 303 314 1983
19. S. Sahni Y. Cho Complexity of scheduling shops with no wait in process Mathematics of Operations Research 4 448 457 1979
20. S.V. Sevastianov G.J. Woeginger Makespan minimization in open shops: a polynomial time approximation scheme Mathematical Programming 82 191 198 1998
21. J.B. Sidney C.N. Potts C. Sriskandarajah A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups Operations Research Letters 26 165 173 2000
22. J.B. Sidney C. Sriskandarajah A heuristic for the two-machine no-wait open shop scheduling problem Naval Research Logistics 46 129 145 1999
23. 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 288 294 1997
24. D.A. Wismer Solution of the flow shop scheduling problem with no intermediate queues Operations Research 20 689 697 1972