Abstract
Throughout this book we are concerned with scheduling computer and manufacturing processes. Despite the fact that we deal with two different areas of applications, the same model could be applied. This is because the above processes consist of complex activities to be scheduled, which can be modeled by means of tasks (or jobs), relations among them, processors, sometimes additional resources (and their operational functions), and parameters describing all these items in greater detail. The purpose of the modeling is to find optimal or sub-optimal schedules in the sense of a given criterion, by applying best suited algorithms. These schedules are then used for the original setting to carry out the various activities. In this chapter we introduce basic notions used for such a modeling of computer and manufacturing processes.
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
ACM Record of the project MAC conference on concurrent system and parallel computation, Wood’s Hole, Mass, 1970.
A. V. Aho, J. E. Hoperoft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
J. L. Baer, Optimal scheduling on two processors of different speeds, in: E. Gelenbe, R. Mahl (eds.), Computer Architecture and Networks, North Holland, Amsterdam, 1974.
J. B1’azewicz, W. Cellary, R. S3owiúski, J. Wgglarz, Scheduling under Resource Constraints: Deterministic Models, J. C. Baltzer, Basel, 1986.
A. J. Bernstein, Analysis of programs for parallel programming, IEEE Trans. Comput. EC-15, 1966, 757–762.
J. Bl’azewicz, J. K. Lenstra, A. H. G. Rinnooy Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math. 5, 1983, 11–24.
S. A. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symposium on Theory of Computing, 1971, 151–158.
M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
R. L. Graham, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Ann. Discrete Math. 5, 1979, 287–326.
R. M. Karp, Reducibility among combinatorial problems, in: R. E. Miller, J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, 85–104.
C. V. Ramamoorthy, M. J. Gonzalez, A survey of techniques for recognizing parallel processable streams in computer programs, AFIPS Conference Proceedings, Fall Joint Computer Conference, 1969, 1–15.
E. C. Russel, Automatic program analysis, Ph.D. thesis, Dept. of Engineering, University of California, Los Angeles, 1969.
S. Volansky, Graph model analysis and implementation of computational sequences, Ph.D. thesis, Rep. No.UCLA-ENG-7048, School of Engineering Applied Sciences, University of California, Los Angeles, 1970.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Węglarz, J. (2001). Definition, Analysis and Classification of Scheduling Problems. In: Scheduling Computer and Manufacturing Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04363-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-04363-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07545-2
Online ISBN: 978-3-662-04363-9
eBook Packages: Springer Book Archive