Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Operations Research and Management Science pp 1356–1363Cite as

Scheduling and Sequencing

  • Reference work entry
  • First Online:

  • 760 Accesses

Introduction

Scheduling is the allocation of limited resources over time to perform a given set of jobs or activities. The focus here is on scheduling models with applications to factory and computer systems. Other common uses of the term scheduling include:

  1. 1.

    Project scheduling – the determination of activity times and project duration for complex projects composed of multiple activities with precedence relations;

  2. 2.

    Workforce scheduling – the determination of the number of workers and their duty cycles to meet certain labor restrictions; and

  3. 3.

    Timetabling – the determination of the matching of participants with each other and with resources, such as sports scheduling or student/room exam assignments.

Scheduling problems have been studied informally for centuries. The Gantt Chart, developed in World War I for logistics purposes, is a graphical representation of tasks and resources over time, and was the first formal model used for scheduling purposes. Critical path methods were...

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   899.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

Learn about institutional subscriptions

References

  • Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391–401.

    Article  Google Scholar 

  • Anderson, E. J., Glass, C. A., & Potts, C. N. (1997). Machine scheduling. In E. H. L. Aaarts & J. K. Lenstra (Eds.), 361–414 in Local Search in Combinatorial Optimization. Chichester, UK: Wiley.

    Google Scholar 

  • Baker, K. (1995). Elements of sequencing and scheduling (Rev. ed.). Hanover, NH: Amos Tuck School of Business Administration, Dartmouth College.

    Google Scholar 

  • Baker, K., & Scudder, G. (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research, 38, 22–36.

    Article  Google Scholar 

  • Baker, K., & Trietsch, D. (2009). Principles of sequencing and scheduling. Hoboken, NJ: Wiley.

    Book  Google Scholar 

  • Bertsekas, D. P. (1987). Dynamic programming: Deterministic and stochastic models. Englewood Cliffs, NJ: Prentice Hall.

    Google Scholar 

  • Blazewicz, J., Cellary, W., Slowinski, R., & Weglarz, J. (1986). Scheduling under resource constraints – Deterministic models. Annals of Operations Research, 7.

    Google Scholar 

  • Carlier, J., & Pinson, E. (1988). An algorithm for solving the job-shop problem. Management Science, 35, 164–176.

    Article  Google Scholar 

  • Chen, Z.-L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58, 130–148.

    Article  Google Scholar 

  • Chen, Z.-L., & Hall, N. G. (2007). Supply chain scheduling: Conflict and cooperation in assembly systems. Operations Research, 55, 1072–1089.

    Article  Google Scholar 

  • Conway, R., Maxwell, W., & Miller, L. (1967). Theory of scheduling. Reading, MA: Addison-Wesley.

    Google Scholar 

  • Crama, Y. (1997). Combinatorial models for production scheduling in automated manufacturing systems. European Journal of Operational Research, 99, 136–153.

    Article  Google Scholar 

  • Daniels, R., & Kouvelis, P. (1995). Robust scheduling to hedge against processing time uncertainty in single stage production. Management Science, 41, 363–376.

    Article  Google Scholar 

  • Fisher, H., & Thompson, G. (1963). Probabilistic learning combinations of local job-shop scheduling rules. In J. Muth & G. Thompson (Eds.), Industrial scheduling (pp. 225–251). Englewood Cliffs, NJ: Prentice-Hal.

    Google Scholar 

  • Fox, M. S., & Smith, S. F. (1984). ISIS: A knowledge-based system for factory scheduling. Expert Systems, 1, 25–49.

    Article  Google Scholar 

  • French, S. (1982). Sequencing and scheduling: An introduction to the mathematics of the job shop. Chichester, UK: Harwood.

    Google Scholar 

  • Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W.H. Freeman & Company.

    Google Scholar 

  • Graham, R. (1969). Bounds on multiprocessor timing anomalies. SIAM Journal on Applied Mathematics, 17, 416–425.

    Article  Google Scholar 

  • Hall, N. G., Kamoun, H., & Sriskandarajah, C. (1997). Scheduling in robotic cells: Classification, two and three machine cells. Operations Research, 45, 421–439.

    Article  Google Scholar 

  • Hall, N. G., & Posner, M. E. (1991). Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date. Operations Research, 39, 847–856.

    Article  Google Scholar 

  • Hall, N. G., Posner, M. E., & Potts, C. N. (1998). Scheduling with finite capacity output buffers. Operations Research, 46, S84–S97.

    Article  Google Scholar 

  • Hall, N. G., Posner, M. E., & Potts, C. N. (2009). Online scheduling with known arrival times. Mathematics of Operations Research, 34, 92–102.

    Article  Google Scholar 

  • Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling: Batching and delivery. Operations Research, 51, 566–584.

    Article  Google Scholar 

  • Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510–525.

    Article  Google Scholar 

  • Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592–623.

    Article  Google Scholar 

  • Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles.

    Google Scholar 

  • Johnson, S. (1954). Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.

    Article  Google Scholar 

  • Lawler, E., Lenstra, J., Rinnooy Kan, A., & Shmoys, D. (1993). Sequencing and scheduling: Algorithms and complexity. In S. Graves, A. Rinnooy Kan, & P. Zipkin (Eds.), Handbooks in operations research and management science (Logistics of production and inventory, Vol. 4). Amsterdam: North-Holland.

    Google Scholar 

  • Lee, C.-Y. (2004). Machine scheduling with availability constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 22-1–22-13). Boca Raton: Chapman & Hall/ CRC.

    Google Scholar 

  • Lee, C.-Y., Li, L., & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1–42.

    Article  Google Scholar 

  • Lee, C.-Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764–775.

    Article  Google Scholar 

  • Matsuo, H., Suh, C. J., & Sullivan, R. S. (1989). A controlled search simulated annealing method for the single machine weighted tardiness problem. Annals of Operations Research, 21, 85–108.

    Article  Google Scholar 

  • McKay, K., Safayeni, F., & Buzacott, J. (1988). Job-shop scheduling theory: What is relevant. Interfaces, 18(4), 84–90.

    Article  Google Scholar 

  • McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6, 1–12.

    Article  Google Scholar 

  • Monma, C. L. (1981). Sequencing with general precedence constraints. Mathematics of Operations Research, 4, 215–224.

    Article  Google Scholar 

  • Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37, 798–804.

    Article  Google Scholar 

  • Morton, T., & Pentico, D. (1993). Heuristic scheduling systems. New York: Wiley.

    Google Scholar 

  • Ng, C. T., & Kovalyov, M. Y. (2004). An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Naval Research Logistics, 51, 307–315.

    Article  Google Scholar 

  • Pinedo, M. (1995). Scheduling: Theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice Hall.

    Google Scholar 

  • Pinedo, M., & Chao, X. (1998). Operations scheduling: Applications in manufacturing and services. Burr Ridge, IL: McGraw-Hill.

    Google Scholar 

  • Potts, C. N., & Kovalyov, M. Y. (2002). Scheduling with batching: A review. European Journal of Operational Research, 120, 228–249.

    Article  Google Scholar 

  • Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: A survey of milestones. Journal of the Operational Research Society, 60, S41–S68.

    Article  Google Scholar 

  • Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis (pp. 15-1–15-43). Boca Raton: Chapman & Hall/ CRC.

    Google Scholar 

  • Righter, R. (1994). Stochastic scheduling. In M. Shaked & G. Shanthikumar (Eds.), Stochastic orders. San Diego, CA: Academic Press.

    Google Scholar 

  • Santos, C., & Magazine, M. (1985). Batching in single operation manufacturing systems. Operations Research Letters, 4, 99–103.

    Article  Google Scholar 

  • Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1–15.

    Article  Google Scholar 

  • Smith, W. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59–66.

    Article  Google Scholar 

  • Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38, 1495–1509.

    Article  Google Scholar 

  • Trietsch, D., & Baker, K. (1993). Basic techniques for lot streaming. Operations Research, 41, 1065–1076.

    Article  Google Scholar 

  • Widmer, M., & Hertz, A. (1989). A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41, 186–193.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, Fisher College of Business, The Ohio State University, 658 Fisher Hall, 2100 Neil Avenue, Columbus, OH, 43210-1144, USA

    Nicholas G. Hall

  2. College of Business, University of Cincinnati, 2925 Campus Green Drive, 210020, Cincinnati, OH, 45221-0020, USA

    Michael Magazine

Authors
  1. Nicholas G. Hall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Magazine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicholas G. Hall .

Editor information

Editors and Affiliations

  1. Robert H. Smith School of Business, University of Maryland, College Park, MD, USA

    Saul I. Gass

  2. Robert H. Smith School of Business and Institute for Systems Research, University of Maryland, College Park, MD, USA

    Michael C. Fu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Hall, N.G., Magazine, M. (2013). Scheduling and Sequencing. In: Gass, S.I., Fu, M.C. (eds) Encyclopedia of Operations Research and Management Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1153-7_925

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-1153-7_925

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-1137-7

  • Online ISBN: 978-1-4419-1153-7

  • eBook Packages: Business and Economics

Publish with us

Policies and ethics

Search

Navigation