We study the preemptive and non-preemptive versions of the job shop scheduling problem when the number of machines and the number of operations per job are fixed. We present linear time approximation schemes for both problems. These algorithms are the best possible for such problems in two regards: they achieve the best possible performance ratio since both problems are known to be strongly NP-hard; and they have optimum asymptotic time complexity.


Optimum Schedule Feasible Schedule Total Processing Time Polynomial Time Approximation Scheme Open Shop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Gonzales, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the ACM 23, 665–679 (1976)CrossRefGoogle Scholar
  3. 3.
    Gonzales, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Operations Research 26, 36–52 (1978)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Goldberg, L.A., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. In: Proceedings of the 8th Symposium on Discrete Algorithms SODA 1997, pp. 599–608 (1997)Google Scholar
  5. 5.
    Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel pricedirective decomposition. Mathematics of Operations Research 21, 321–340 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Hall, L.A.: Approximability of flow shop scheduling. Mathematical Programming 82, 175–190 (1998)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Jansen, K., Porkolab, L.: Linear-time approximation schemes for scheduling malleable parallel tasks. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 490–498 (1999)Google Scholar
  8. 8.
    Jansen, K., Solis-Oba, R., Mastrolilli, M.: Linear time approximation scheme for the flexible job shop problem, unpublished manuscriptGoogle Scholar
  9. 9.
    Jansen, K., Solis-Oba, R., Sviridenko, M.I.: Makespan minimization in job shops: a polynomial time approximation scheme. In: Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pp. 394–399 (1999)Google Scholar
  10. 10.
    Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Handbook in Operations Research and Management Science, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)Google Scholar
  11. 11.
    Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20, 257–301 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Sevastianov, S.V.: Bounding algorithms for the routing problem with arbitrary paths and alternative servers. Cybernetics 22, 773–780 (1986)CrossRefGoogle Scholar
  13. 13.
    Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in open shops: A polynomial time approximation scheme. Mathematical Programming 82, 191–198 (1998)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevastianov, S.V., Shmoys, D.B.: Short shop schedules. Operations Research 45, 288–294 (1997)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Klaus Jansen
    • 1
  • Roberto Solis-Oba
    • 2
  • Maxim Sviridenko
    • 3
  1. 1.Instituto Dalle Molle di Studi sull’Intelligenza ArtificialeLuganoSwitzerland
  2. 2.Max Planck Institut für InformatikSaarbrückenGermany
  3. 3.Sobolev Institute of MathematicsNovosibirskRussia

Personalised recommendations