A linear time approximation scheme for the job shop scheduling problem

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

Volumn 1671, Issue , 1999, Pages 177-188

  Jansen, Klaus ^a   Solis Oba, Roberto ^b   Sviridenko, Maxim ^c  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

ASYMPTOTIC TIME COMPLEXITY; JOB SHOP SCHEDULING PROBLEMS; LINEAR-TIME APPROXIMATION; NON-PREEMPTIVE; PERFORMANCE RATIO; STRONGLY NP-HARD;

JOB SHOP SCHEDULING;

EID: 84958748355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_19     Document Type: Conference Paper

References (14)

1. M.R. Garey, D.S. Johnson and R. Sethi, The complexity of owshop and jobshop scheduling, Mathematics of Operations Research 1 (1976), 117-129.
2. T. Gonzales and S. Sahni, Open shop scheduling to minimize finish time, Journal of the ACM 23 (1976), 665-679.
3. T. Gonzales and S. Sahni, Flowshop and jobshop schedules: complexity and approximation, Operations Research 26 (1978), 36-52.
4. L.A. Goldberg, M. Paterson, A. Srinivasan, and E. Sweedyk, Better approximation guarantees for job-shop scheduling, Proceedings of the 8th Symposium on Discrete Algorithms SODA 97, 599-608.
5. M.D. Grigoriadis and L.G. Khachiyan, Coordination complexity of parallel pricedirective decomposition, Mathematics of Operations Research 21 (1996), 321-340.
6. L.A. Hall, Approximability of flow shop scheduling, Mathematical Programming 82 (1998), 175-190.
7. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, 490-498.
8. K. Jansen, R. Solis-Oba, and M. Mastrolilli, Linear time approximation scheme for the exible job shop problem, unpublished manuscript.
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, 1999, 394-399.
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. S.A. Plotkin, D.B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research 20 (1995), 257-301.
12. S.V. Sevastianov, Bounding algorithms for the routing problem with arbitrary paths and alternative servers, Cybernetics 22 (1986), 773-780.
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. 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.