Abstract
In a shop scheduling problem a set of jobs must be processed by a group of machines. Each job consists of a set of operations, and there are certain precedence constraints in the order in which the operations of a job must be processed. The goal is to schedule the jobs so as to complete them all in the smallest amount of time. We present a technique that can be used to design linear time approximation schemes for shop scheduling problems when the number of machines and the maximum number of operations per job are fixed.
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
M.R. Garey, D.S. Johnson, and R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1 (1976), 117–129.
T. Gonzales and S. Sahni, Open shop scheduling to minimize finish time, Journal of the ACM 23 (1976), 665–679.
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.
M.D. Grigoriadis and L.G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research 21 (1996), 321–340.
L.A. Hall, Approximability of flow shop scheduling, Mathematical Programming 82 (1998), 175–190.
K. Jansen, M. Mastrolilli, and R. Solis-Oba, Approximation algorithms for flexible job shop problems, unpublished manuscript, 1999.
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.
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.
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.
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.
S.V. Sevastianov, Bounding algorithms for the routing problem with arbitrary paths and alternative servers, Cybernetics 22 (1986), 773–780.
S.V. Sevastianov and G.J. Woeginger, Makespan minimization in open shops: A polynomial time approximation scheme, Mathematical Programming 82 (1998), 191–198.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Jansen, K., Solis-Oba, R., Sviridenko, M. (2000). Linear Time Approximation Schemes for Shop Scheduling Problems. In: Pardalos, P.M. (eds) Approximation and Complexity in Numerical Optimization. Nonconvex Optimization and Its Applications, vol 42. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3145-3_20
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3145-3_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4829-8
Online ISBN: 978-1-4757-3145-3
eBook Packages: Springer Book Archive