Skip to main content

Scheduling and sequencing

  • Reference work entry
  • First Online:
Encyclopedia of Operations Research and Management Science

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 532.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adams, J., Balas, E., and Zawack, D. (1988). “The Shifting Bottleneck Procedure for Job Shop Scheduling,” Mgmt. Sci., 34, 391–401.

    Google Scholar 

  2. Anderson, E.J., Glass, C.A., and Potts, C.N. (1997). “Machine Scheduling,” 361–414 in Local Search in Combinatorial Optimization, ed. Aaarts, E.H.L. and Lenstra, J.K., Wiley, Chichester, U.K.

    Google Scholar 

  3. Baker, K. (1995). Elements of Sequencing and Scheduling, revised edition, Amos Tuck School of Business Administration, Dartmouth College, Hanover, NH.

    Google Scholar 

  4. Baker, K. and Scudder, G. (1990). “Sequencing with Earliness and Tardiness Penalties: A Review,” Opns. Res., 38, 22–36.

    Google Scholar 

  5. Bertsekas, D.P. (1987). Dynamic Programming: Deterministic and Stochastic Models, Prentice Hall, Englewood Cliffs, NJ.

    Google Scholar 

  6. Blazewicz, J., Cellary, W., Slowinski, R., and Weglarz, J. (1986). “Scheduling Under Resource Constraints — Deterministic Models,” Ann. Opns. Res.,,7.

    Google Scholar 

  7. Carlier, J. and Pinson, E. (1988). “An Algorithm for Solving the Job-Shop Problem,” Mgmt. Sci., 35, 164–176.

    Google Scholar 

  8. Conway, R., Maxwell, W., and Miller, L. (1967). Theory of Scheduling, Addison-Wesley, Reading, MA.

    Google Scholar 

  9. Crama, Y. (1997). “Combinatorial Models for Production Scheduling in Automated Manufacturing Systems,” Eur. Jl. Opnl. Res., 99, 136–153.

    Google Scholar 

  10. Daniels, R. (1990). “A Multi-Objective Approach to Resource Allocation in Single Machine Scheduling,” Eur. Jl. Opnl. Res., 48, 226–241.

    Google Scholar 

  11. Daniels, R. and Kouvelis, P. (1995). “Robust Scheduling to Hedge Against Processing Time Uncertainty in Single Stage Production,” Mgmt. Sci., 41, 363–376.

    Google Scholar 

  12. Fisher, H. and Thompson, G. (1963). “Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules,” 225–251 in Industrial Scheduling, ed. Muth, J. and Thompson, G., Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  13. Fox, M.S. and Smith, S.F. (1984). “ISIS: A Knowledge-Based System for Factory Scheduling,” Expert Syst., 1, 25–49.

    Google Scholar 

  14. French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop, Harwood, Chichester, U.K.

    Google Scholar 

  15. Garey, M.R. and Johnson, D.S. (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman & Company, San Francisco.

    Google Scholar 

  16. Graham, R. (1969). “Bounds on Multiprocessor Timing Anomalies,” SIAM Jl. of App. Math., 17, 416–425.

    Google Scholar 

  17. Hall, N.G., Kamoun, H., and Sriskandarajah, C. (1997). “Scheduling in Robotic Cells: Classification, Two and Three Machine Cells,” Opns. Res., 45, 421–439.

    Google Scholar 

  18. Hall, N.G. and Posner, M.E. (1991). “Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date,” Opns. Res., 39, 847–856.

    Google Scholar 

  19. Hall, N.G., Posner, M.E., and Potts, C.N. (1998). “Scheduling With Finite Capacity Output Buffers,” Opns. Res., 46, S84–S97.

    Google Scholar 

  20. Hall, N.G. and Sriskandarajah, C. (1996). “A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process,” Opns. Res., 44, 510–525.

    Google Scholar 

  21. 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 

  22. Johnson, S. (1954). “Optimal Two and Three Stage Production Schedules with Setup Times Included,” Naval Res. Logistics Qtrly., 1, 61–68.

    Google Scholar 

  23. Lawler, E., Lenstra, J., Rinnooy, Kan, A., and Shmoys, D. (1993). “Sequencing and Scheduling: Algorithms and Complexity,” in Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, ed. Graves, S., Rinnooy Kan, A. and Zipkin, P.

    Google Scholar 

  24. Lee, C.-Y., Li, L., and Pinedo, M. (1997). “Current Trends in Deterministic Scheduling,” Ann. Opns. Res., 70, 1–42.

    Google Scholar 

  25. Lee, C.-Y., Uzsoy, R., and Martin-Vega, L.A. (1992). “Efficient Algorithms for Scheduling Semiconductor Burn-in Operations,” Opns. Res., 40, 764–775.

    Google Scholar 

  26. Matsuo, H., Suh, C.J., and Sullivan, R.S. (1989). “A Controlled Search Simulated Annealing Method for the Single Machine Weighted Tardiness Problem,” Ann. Opns. Res., 21, 85–108.

    Google Scholar 

  27. McKay, K., Safayeni, F., and Buzacott, J. (1988). “Job-Shop Scheduling Theory: What is Relevant,” Interfaces, 18(4), 84–90.

    Google Scholar 

  28. McNaughton, R. (1959). “Scheduling with Deadlines and Loss Functions,” Mgmt. Sci., 6, 1–12.

    Google Scholar 

  29. Monma, C.L. (1981). “Sequencing with General Precedence Constraints,” Math. Opns. Res., 4, 215–224.

    Google Scholar 

  30. Monma, C.L. and Potts, C.N. (1989). “On the Complexity of Scheduling With Batch Setup Times,” Opns. Res., 37, 798–804.

    Google Scholar 

  31. Morton, T. and Pentico, D. (1993). Heuristic Scheduling Systems, John Wiley, New York.

    Google Scholar 

  32. Nahmias, S. (1993). Production and Operations Analysis, 2nd edition, Irwin, Homewood, IL.

    Google Scholar 

  33. Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, NJ.

    Google Scholar 

  34. Pinedo, M. and Chao, X. (1998). Operations Scheduling: Applications in Manufacturing and Services, to be published by McGraw-Hill, Burr Ridge, IL.

    Google Scholar 

  35. Righter, R. (1994). “Stochastic Scheduling,” in Stochastic Orders, ed. Shaked, M. and Shanthikumar, G., Academic Press, San Diego.

    Google Scholar 

  36. Santos, C. and Magazine, M. (1985). “Batching in Single Operation Manufacturing Systems,” Opns. Res. Lett., 4, 99–103.

    Google Scholar 

  37. Smith, W. (1956). “Various Optimizers for Single Stage Production,” Naval Res. Logistics Qtrly.,3, 59–66.

    Google Scholar 

  38. Storer, R.H., Wu, S.D., and Vaccari, R. (1992). “New Search Spaces for Sequencing Problems With Application to Job Shop Scheduling,” Mgmt. Sci., 38, 1495–1509.

    Google Scholar 

  39. Trietsch, D. and Baker, K. (1993). “Basic Techniques for Lot Streaming,” Opns. Res., 41, 1065–1076.

    Google Scholar 

  40. Widmer, M. and Hertz, A. (1989). “A New Heuristic Method for the Flow Shop Sequencing Problem,” Eur. Jl. Opnl. Res., 41, 186–193.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this entry

Cite this entry

Hall, N.G., Magazine, M. (2001). Scheduling and sequencing . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_925

Download citation

  • DOI: https://doi.org/10.1007/1-4020-0611-X_925

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-7923-7827-3

  • Online ISBN: 978-1-4020-0611-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics