Abstract
Scheduling problems have attracted the attention of the algorithms community for several decades. A large number of scheduling problems have been proposed and studied, and many different techniques have been devised for solving them. Among the reasons why scheduling problems are so fascinating are their rich variety, both in form and in complexity. Furthermore, there is a sea of applications for scheduling problems, which arise from an equally varied number of areas.
This note briefly surveys a technique that has been successfully used to solve (or approximately solve) a large number of scheduling problems with minimax objective function.
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.
Author partially supported by the Natural Sciences and Engineering Research Council of Canada grant R3050A01.
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
A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th Annual European Symposium on Algorithms (1997), 1–12.
J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 418–427.
T. Gonzalez, O. Ibarra, and S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1977), 155–166.
L. Hall, Approximability of flow shop scheduling, Mathematical Programming 82 (1998), 175–190.
L. Hall, Approximation algorithms for scheduling, in Approximation algorithms for NP-hard problems edited by D. S. Hochbaum, 1–45.
D. Hochbaum and D. B. Shmoys, Using dual approximation algorithms for scheduling problems: practical and theoretical results, Journal of the Association for Computing Machinery 34 (1987), 144–162.
K. Jansen, M. Mastrolilli, and R. Solis-Oba, Job shop scheduling problems with controllable processing times, Proceedings of the 7th Italian Conference on Theoretical Computer Science (2001), 107–122.
K. Jansen, L. Porkolab, Polynomial time approximation schemes for general multiprocessor job shop scheduling, 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, LNCS 1853, 878–889, (2000).
K. Jansen and M. Sviridenko, Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem, 17th Symposium on Theoretical Aspects of Computer Science, STACS 2000, LNCS 1770, 455–565, (2000).
K. Jansen, R. Solis-Oba, and M. Sviridenko, Makespan minimization in job shops: a polynomial time approximation scheme, SIAM Journal on Discrete Mathematics, to appear.
K. Jansen and R. Solis-Oba, Scheduling jobs with chain precedence constraints, manuscript.
D. Karger, C. Stein, J. Wein, Scheduling algorithms, in CRC Algorithms and Theory of Computation Handbook edited by M. J. Atallah, Chapter 35.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, and D. B. Shmoys, Sequencing and scheduling: algorithms and complexity, in Handbooks in Operations Research and Management Science 4 (1993), 445–522.
S. V. Sevastianov and G. J. Woeginger, Makespan minimization in open shops: a polynomial time approximation scheme, Mathematical Programming 82 (1998), 191–198.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Solis-Oba, R. (2003). A Framework for Designing Approximation Algorithms for Scheduling Problems. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds) Experimental and Efficient Algorithms. WEA 2003. Lecture Notes in Computer Science, vol 2647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44867-5_21
Download citation
DOI: https://doi.org/10.1007/3-540-44867-5_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40205-3
Online ISBN: 978-3-540-44867-9
eBook Packages: Springer Book Archive