Abstract
Scheduling problems can be understood in general as the problems of allocating resources over time to perform a set of tasks being parts of some processes, among which computational and manufacturing ones are most important. Tasks individually compete for resources which can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools. The same is true for task characteristics, e.g. ready times, due dates, relative urgency weights, functions describing task processing in relation to allotted resources. Moreover, a structure of a set of tasks, reflecting relations among them, can be defined in different ways. In addition, different criteria which measure the quality of the performance of a set of tasks can be taken into account.
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
Preview
Unable to display preview. Download preview PDF.
References
K. Baker, Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.
J. Błażewicz, W. Cellary, R. Słowiński, J. Węglarz, Scheduling under Resource Constraints: Deterministic Models, J. C. Baltzer, Basel, 1986.
P. Brucker, Scheduling Algorithms, Springer, 4. edition, Berlin, 2004.
P. Chretienne, E. G. Coffman, J. K. Lenstra, Z. Liu (eds.), Scheduling Theory and its Applications, Wiley, New York, 1995.
R. W. Conway, W. L. Maxwell, L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass. 1967.
E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.
K. Ecker, Organisation von parallelen Prozessen, BI-Wissenschaftsverlag, Mannheim, 1977.
S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Horwood, Chichester, 1982.
S. K. Gupta, J. Kyparisis, Single machine scheduling research, OMEGA Internat. J. Management Sci. 15, 1987, 207–227.
J. K. Lenstra, Sequencing by Enumerative Methods, Mathematical Centre Tract 69, Amsterdam, 1977.
J.Y.-T. Leung (ed.), Handbook of Scheduling: Algorithms, Models and Performance Analysis, Chapman & Hall, Boca Raton, 2004.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: S. C. Graves, A. H. G. Rinnooy Kan, P. H. Zipkin (eds.), Handbook in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, Elsevier, Amsterdam, 1993.
M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, 2.edition, Englewood Cliffs, N. J., 2001.
M. Pinedo, Planning and Scheduling in Manufacturing and Services, Springer, New York, 2005.
A. H. G. Rinnooy Kan, Machine Scheduling Problems; Classification, Complexity and Computations, Martinus Nijhoff, The Hague, 1976.
V. S. Tanaev, V. S. Gordon and Y. M. Shafransky, Scheduling Theory. Single-Stage Systems, Kluwer, Dordrecht, 1994.
V. S. Tanaev, Y. N. Sotskov and V. A. Strusevich, Scheduling Theory. Multistage Systems, Kluwer, Dordrecht, 1994.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Introduction. In: Handbook on Scheduling. International Handbook on Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32220-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-32220-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28046-0
Online ISBN: 978-3-540-32220-7
eBook Packages: Business and EconomicsBusiness and Management (R0)