Abstract
Over the last fifty years a considerable amount of research effort has been focused on deterministic scheduling. The number and variety of models considered is astounding. During this time a notation has evolved that succinctly captures the structure of many (but for sure not all) deterministic models that have been considered in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
K.R. Baker and G.D. Scudder (1990) “Sequencing with Earliness and Tardiness Penalties: A Review”, Operations Research, Vol. 38, pp. 22–36.
R.W. Conway, W.L. Maxwell, L.W. Miller (1967) Theory of Scheduling, Addison-Wesley, Reading, MA.
S. French (1982) Sequencing and Scheduling: an Introduction to the Mathematics of the Job Shop, Horwood, Chichester, England.
B. Giffler and G.L. Thompson (1960) “Algorithms for Solving Production Scheduling Problems”, Operations Research, Vol. 8, pp. 487–503.
R.L. Graham (1966) “Bounds for Certain Multiprocessing Anomalies”, Bell System Technical Journal, Vol. 45, pp. 1563–1581.
J. Herrmann, C.-Y. Lee and J. Snowdon (1993) “A Classification of Static Scheduling Problems”, in Complexity in Numerical Optimization, P.M. Pardalos (ed.), World Scientific, pp. 203–253.
B.J. Lageweg, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1981) “Computer-Aided Complexity Classification of Deterministic Scheduling Problems”, Technical Report BW 138/81, the Mathematical Centre, Amsterdam, the Netherlands.
B.J. Lageweg, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1982) “Computer-Aided Complexity Classification of Combinatorial Problems”, Communications of the ACM, Vol. 25, pp 817–822.
E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan (1982) “Recent Developments in Deterministic Sequencing and Scheduling: A Survey”, in Deterministic and Stochastic Scheduling, Dempster, Lenstra and Rinnooy Kan (eds.), pp. 35–74, Reidel, Dordrecht.
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys (1993) “Sequencing and Scheduling: Algorithms and Complexity”, in Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, S. S. Graves, A. H. G. Rinnooy Kan and P. Zipkin, (eds.), pp. 445–522, North-Holland, New York.
C.-Y. Lee (2004) “Machine Scheduling with Availability Constraints”, Chapter 22 in Handbook of Scheduling, J. Y.-T. Leung (ed.), Chapman and Hall/CRC, Boca Raton, Florida.
J.K. Lenstra (1977) “Sequencing by Enumerative Methods”, Mathematical Centre Tracts 69, Centre for Mathematics and Computer Science, Amsterdam.
C.N. Potts and M.Y. Kovalyov (2000) “Scheduling with Batching: A Review”, European Journal of Operational Research, Vol. 120, pp. 228–249.
M. Raghavachari (1988) “Scheduling Problems with Non-Regular Penalty Functions: A Review”, Opsearch, Vol. 25, pp. 144–164.
A.H.G. Rinnooy Kan (1976) Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, The Hague.
V.G. Timkovsky (2004) “Reducibility among Scheduling Classes”, Chapter 8 in Handbook of Scheduling, J. Y.-T. Leung (ed.), Chapman and Hall/CRC, Boca Raton, Florida.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Pinedo, M.L. (2016). Deterministic Models: Preliminaries. In: Scheduling. Springer, Cham. https://doi.org/10.1007/978-3-319-26580-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-26580-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26578-0
Online ISBN: 978-3-319-26580-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)