Abstract
In this paper we give a brief historical overview of the research done in scheduling theory and its applications. We discuss the most recent developments as well as the directions in which the field is going.
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.
Literature
Bhaskaran, K.; Pinedo, M. Dispatching Handbook of Industrial Engineering, Chapter 83, J. Wiley, NY (1991)
Graham, R. Bounds on Multiprocessing Anomalies SIAM J. of Appl. Math., 17, 263–269 (1969)
Hadavi, K.; Voigt, K. An Integrated Planning and Scheduling Environment Proceedings of AI in Manufacturing Conference, Long Beach (1987)
Lawler, E.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G.; Shmoys, D.B. Sequencing and Scheduling: Algorithms and Complexity. Report BS-R8909, Centre for Mathematics and Computer Science, Amsterdam (1989).
Vepsalainen, A.; Morton, T. Priority Rules for Job Shops with Weighted Tardiness Costs. Management Science 34, 1035–1047 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pinedo, M., Hadavi, K. (1992). Scheduling: Theory, Algorithms and Systems Development. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds) Operations Research Proceedings 1991. Operations Research Proceedings 1991, vol 1991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46773-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-46773-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55410-3
Online ISBN: 978-3-642-46773-8
eBook Packages: Springer Book Archive