Definition, Analysis and Classification of Scheduling Problems
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 suboptimal 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.
KeywordsSchedule Problem Flow Shop Precedence Constraint Open Shop Schedule Length
Unable to display preview. Download preview PDF.
- ACM70.ACM Record of the project MAC conference on concurrent system and parallel computation, Wood’s Hole, Mass, 1970.Google Scholar
- AHU74.A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.Google Scholar
- Bae74.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.Google Scholar
- BCSW86.J. Błazewicz, W. Cellary, R. Słowiński, J. Weglarz, Scheduling under Resource Constraints: Deterministic Models, J. C. Baltzer, Basel, 1986.Google Scholar
- CD73.E. G. Coffman Jr., P. J. Denning, Operating Systems Theory, Prentice-Hall, Englewood Cliffs, N.J., 1973.Google Scholar
- Coo71.S. A. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symposium on Theory of Computing, 1971, 151–158.Google Scholar
- GJ79.M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.Google Scholar
- RG69.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.Google Scholar
- Rus69.E. C. Russel, Automatic program analysis, Ph.D. thesis, Dept. of Engineering, University of California, Los Angeles, 1969.Google Scholar
- Vol70.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.Google Scholar