Skip to main content

Scheduling

  • Chapter
  • First Online:
Modeling and Simulation

Abstract

The—preferably optimal—assignment of resources (time, personnel, tools, etc.) to tasks that need to be carried out, is a challenging and economically significant field of decision making. Examples include the planning of a project, the production flow in a factory, class schedules in a school, and supplying rental car customers with cars.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 79.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. V.G. Adlakha and V.G. Kulkarni. A classified bibliography of research on stochastic PERT networks: 1966–1987. INFOR, 27(3):272–296, 1989.

    MATH  Google Scholar 

  2. Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft. Data Structures and Algorithms. Addison-Wesley, 1983.

    Google Scholar 

  3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009.

    Google Scholar 

  4. Delbert Ray Fulkerson. Expected critical path lengths in PERT networks. Operations Research, 10:808–817, 1962.

    Google Scholar 

  5. Rolf H. Möhring. Scheduling under uncertainty: Optimizing against a randomizing adversary. In Klaus Jansen, editor, Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 15–26. Springer, 2000.

    Google Scholar 

  6. Rolf H. Möhring. Scheduling under uncertainty: Bounding the makespan distribution. In Helmut Alt, editor, Computational Discrete Mathematics: Advanced Lectures, volume 2122 of Lecture Notes in Computer Science, pages 79–97. Springer, 2001.

    Google Scholar 

  7. Michael L. Pinedo. Planning and Scheduling in Manufacturing and Services. Springer, 2005.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bungartz, HJ., Zimmer, S., Buchholz, M., Pflüger, D. (2014). Scheduling. In: Modeling and Simulation. Springer Undergraduate Texts in Mathematics and Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39524-6_5

Download citation

Publish with us

Policies and ethics