Introduction

  • Jacek Błażewicz
  • Klaus H. Ecker
  • Erwin Pesch
  • Günter Schmidt
  • Jan Węglarz
Chapter

Abstract

Let us first describe the purpose of this book, starting with the explanation of its title. In general, scheduling problems can be understood very broadly 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 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.

Keywords

Explosive Lution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bak74.
    K. Baker, Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.Google Scholar
  2. BCSW86.
    J. Blaiewicz, W. Cellary, R. Síowitíski, J. Węglarz, Scheduling under Resource Constraints: Deterministic Models, J. C. Baltzer, Basel, 1986.Google Scholar
  3. Bru98.
    P. Brucker, Scheduling Algorithms, Springer, Berlin, 1998.CrossRefGoogle Scholar
  4. CCLL95.
    P. Chretienne, E. G. Coffman, J. K. Lenstra, Z. Liu (eds.), Scheduling Theory and its Applications, Wiley, New York, 1995.Google Scholar
  5. CMM67.
    R. W. Conway, W. L. Maxwell, L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass. 1967.Google Scholar
  6. Cof76.
    E. G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, J. Wiley, New York, 1976.Google Scholar
  7. Eck77.
    K. Ecker, Organisation von parallelen Prozessen, BI-Wissenschaftsverlag, Mannheim, 1977.Google Scholar
  8. Fre82.
    S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Horwood, Chichester, 1982.Google Scholar
  9. GK87.
    S. K. Gupta, J. Kyparisis, Single machine scheduling research, OMEGA Internat. J. Management Sci. 15, 1987, 207–227.CrossRefGoogle Scholar
  10. Len77.
    J. K. Lenstra, Sequencing by Enumerative Methods, Mathematical Centre Tract 69, Amsterdam, 1977.Google Scholar
  11. LLRKS93.
    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.Google Scholar
  12. Pin95.
    M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, N. J., 1995.Google Scholar
  13. Rin76.
    A. H. G. Rinnooy Kan, Machine Scheduling Problems; Classification, Complexity and Computations, Martinus Nijhoff, The Hague, 1976.Google Scholar
  14. TGS94.
    V. S. Tanaev, V. S. Gordon and Y. M. Shafransky, Scheduling Theory. SingleStage Systems, Kluwer, Dordrecht, 1994.CrossRefGoogle Scholar
  15. TSS94.
    V. S. Tanaev, Y. N. Sotskov and V. A. Strusevich, Scheduling Theory. Multi-Stage Systems, Kluwer, Dordrecht, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jacek Błażewicz
    • 1
  • Klaus H. Ecker
    • 2
  • Erwin Pesch
    • 3
  • Günter Schmidt
    • 2
  • Jan Węglarz
    • 1
  1. 1.Institute of Computing ScienceTechnical University of PoznańPoznańPoland
  2. 2.Institute of Computing ScienceTechnical University of ClausthalClausthal-ZellerfeldGermany
  3. 3.Faculty of EconomicsUniversity of BonnBonnGermany

Personalised recommendations