Abstract
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.
Keywords
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.
This work was supported in part by EU ESPRIT LTR Project 20244 (ALCOM-IT) and by the Swiss Office Fédéral de l’éducation et de la Science Project 97.0315 titled “Platform”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129 (1976)
Gonzales, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the ACM 23, 665–679 (1976)
Gonzales, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Operations Research 26, 36–52 (1978)
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)
Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel pricedirective decomposition. Mathematics of Operations Research 21, 321–340 (1996)
Hall, L.A.: Approximability of flow shop scheduling. Mathematical Programming 82, 175–190 (1998)
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)
Jansen, K., Solis-Oba, R., Mastrolilli, M.: Linear time approximation scheme for the flexible job shop problem, unpublished manuscript
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)
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)
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)
Sevastianov, S.V.: Bounding algorithms for the routing problem with arbitrary paths and alternative servers. Cybernetics 22, 773–780 (1986)
Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in open shops: A polynomial time approximation scheme. Mathematical Programming 82, 191–198 (1998)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, K., Solis-Oba, R., Sviridenko, M. (1999). A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds) Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 1999 1999. Lecture Notes in Computer Science, vol 1671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48413-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-48413-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66329-4
Online ISBN: 978-3-540-48413-4
eBook Packages: Springer Book Archive