Abstract
In the previous chapter we presented a complex industrial scheduling environment and formulated it as a job shop scheduling problem. We then introduced decomposition procedures for these problems, discussed their various practical and computational advantages and the issues involved in the development of effective decomposition methods. In this chapter we provide a review of decomposition approaches for scheduling problems that have been considered in the literature, and discuss how they have addressed the issues raised in the previous chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, J., Balas, E., Zawack, D.,“The Shifting Bottleneck Procedure for Job-Shop Scheduling”, Management Science 34, 391–401 (1988).
Balas, E., Lenstra, J.K., Vazacopoulos, A., “One Machine Scheduling with Delayed Precedence Constraints”, Management Science 41, 94–109 (1995).
Bitran G.R., Tirupati, D., “Hierarchical Production Planning”, Chapter 10 in Handbooks in Operations Research and Management Science Vol.4: Logistics of Production and Inventory, S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (eds.), North-Holland (1993).
Bhaskaran, K., Pinedo, M., “Dispatching”, Chapter 83 of Handbook of Industrial Engineering, G. Salvendy (ed.), J. Wiley (1991).
Byeon, E.S., Wu, S.D., Storer, R.H., “Decomposition Heuristics for Robust Job Shop Scheduling”, Research Report 93T-008, Department of Industrial Engineering, Lehigh University (1993).
Chand, S., Traub, R., Uzsoy, R., “Single Machine Scheduling Problems with Dynamic Arrivals: Decomposition Results and a Forward Algorithm”, Naval Research Logistics 43, 709–719 (1996).
Chand, S., Traub, R, Uzsoy, R., “Rolling Horizon Procedures for the Single Machine Dynamic Scheduling Problem”, School of Industrial Engineering, Purdue University, West Lafayette, IN 479071287 (1995).
Dauzere-Peres, S., Lasserre, J.B., “A Modified Shifting Bottleneck Procedure for Job Shop Scheduling”, International Journal of Production Research 31, 923–932 (1993).
Fox, M.S., Smith, S.F., “ISIS-A Knowledge-based System for Factory Scheduling”, Expert Systems 1, 25–49 (1984).
Gershwin, S.B., “Hierarchical Flow Control: A Framework for Scheduling and Planning Discrete Events in Manufacturing Systems”, Proceedings of the IEEE 77, 195–206 (1989).
Hadavi, K., Shahraray, M.S., Voigt, K., “ReDS: A Dynamic Planning, Scheduling and Control System for Manufacturing”, Journal of Manufacturing Systems 9, 332–344 (1989).
Kempf, K., “Scheduling Wafer Fabrication - The Intelligent Way”, SME Quarterly on Electronics Manufacturing Technology 4, 1–3 (1989).
Kempf, K., “Intelligently Scheduling Semiconductor Wafer Fabrication”, Chapter 18 in Intelligent Scheduling Systems, M. Zweben, M. Fox (eds.), Morgan Kaufman, San Francisco (1994).
Kerr, R.M., Ebsary, R.V., “Implementation of an Expert System for Production Scheduling”, European Journal of Operational Research 33, 17–29 (1988).
Lawrence, S., Morton, T.E., “Resource-Constrained Multiproject Scheduling with Tardy Costs: Comparing Myopic, Bottleneck and Resource Pricing Heuristics”, European Journal of Operational Research 64, 168–187 (1993).
Lu, S.H., Ramaswamy, D., Kumar P.R., “Efficient Scheduling Policies to Reduce Mean and Variance of Cycle Time in Semiconductor Manufacturing Plants”, IEEE Transactions on Semiconductor Manufacturing 7, 374–388 (1994).
Luh, P.B., Hoitomt, D.J., “Scheduling of Manufacturing Systems Using the Lagrangian Relaxation Technique”, IEEE Transactions on Robotics and Automation 38, 1066–1079 (1993).
Morton, T.E., “Forward Algorithms for Forward-Thinking Managers”, in Applications of Management Science, R.L. Schulz (ed.), 1–55, JAI Press Inc., Greenwich, CT (1981).
Morton, T.E., Kekre, S. Lawrence, S., Rajagopalan, S., “SCHED-STAR: A Price Based Shop Scheduling Module”, Journal of Manufacturing and Operations Management 1, 131–181 (1988).
Morton, T.E., Narayan, V., Ranmath, P., “A Tutorial on Bottleneck Dynamics: A Heuristic Scheduling Methodology”, Production and Operations Management 4, 94–107 (1995).
Morton, T.E., Pentico, D., Heuristic Scheduling Systems with Application to Project Scheduling, John Wiley, New York (1993).
Ovacik, I.M., Uzsoy, R., “Rolling Horizon Algorithms for a Single-Machine Dynamic Scheduling Problem with Sequence-Dependent Setup Times”, International Journal of Production Research 32, 1243–1263 (1994).
Ovacik, I.M., Uzsoy, R., “Rolling Horizon Procedures for Dynamic Parallel Machine Problems with Sequence Dependent Setup Times”, International Journal of Production Research 33, 3173–3192 (1995).
Pinedo, M., Singer, M., “A Shifting Bottleneck Heuristic for Minimizing the Total Weighted Tardiness in a Job Shop”, Research Report, Department of Industrial Engineering and Operations Research, Columbia University (1996).
Potts, C.N., van Wassenhove, L.N., “A Decomposition Algorithm for the Single Machine Total Tardiness Problem”, Operations Research Letters 1, 177–181 (1982).
Roundy, R.O., Maxwell, W.L., Herer, Y.T., Tayur, S.R., Getzler, A.W., “A Price-Directed Approach to Real-Time Scheduling of Manufacturing Operations”, HE Transactions 23, 149–160 (1991).
Sadeh, N., Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling, Ph.D. Thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (1991).
Sidney, J.R., “Decomposition Algorithms for Single Machine Sequencing with Precedence Relations and Deferral Costs”, Operations Research 23, 283–298 (1975).
Smith, S.F., Ow, P.S., Potvin, J.Y., Muscettola, N., Matthys, D.C., “An Integrated Framework for Generating and Revising Factory Schedules”, Journal of the Operational Research Society 41, 539–552 (1990).
Wu, S.D., Byeon, E.S., Storer, R.H., “A Graph-Theoretic Decomposition for Job Shop Scheduling Problems to Achieve Scheduling Robustness”, Research Report 93T-009, Department of Industrial Engineering, Lehigh University (1993).
Vepsalainen, A.PJ., Morton, T.E., “Improving Local Priority Rules with Global Lead-time Estimates: A Simulation Study”, Journal of Manufacturing and Operations Management 1, 102–118 (1988).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ovacik, I.M., Uzsoy, R. (1997). Review of Decomposition Methods for Factory Scheduling Problems. In: Decomposition Methods for Complex Factory Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6329-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6329-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7906-5
Online ISBN: 978-1-4615-6329-7
eBook Packages: Springer Book Archive