Abstract
Let us start with the description of the purpose of this book. First we should explain how we understand its title. In general, scheduling problems can be understood very broadly as the problems of the allocation of resources over time to perform a set of tasks. By resources we understand arbitrary means tasks compete for. They can be of a very different nature, e.g. manpower, money, processors (machines), energy, tools. Also tasks can have a variety of interpretations starting from machining parts in manufacturing systems up to processing information in computer systems. 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 precedence constraints 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.
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.
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, Theorie Deterministischer Schedules, Bibliographisches Institut Mannheim, Reihe Informatik, 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 Tracts 69, Amsterdam, 1977.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, Sequencing and scheduling: algorithms and complexity, Report Centre Mathematics and Computer Science, Amsterdam, 1989.
A. H. G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague, 1976.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Błazewicz, J., Ecker, K.H., Schmidt, G., Węglarz, J. (1994). Introduction. In: Scheduling in Computer and Manufacturing Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79034-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-79034-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79036-2
Online ISBN: 978-3-642-79034-8
eBook Packages: Springer Book Archive