Abstract
Throughout the body of this book we have covered a number of different aspects of decomposition methods for complex factory scheduling problems. In this chapter we shall review the main developments of this work, and suggest a number of directions for future research. We shall also discuss briefly what type of software and information systems issues need to be resolved for decomposition methods such as those presented in this book to be practical and cost-effective.
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).
Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, W.R., “Designing and Reporting on Computational Experiments with Heuristic Methods”, Journal of Heuristics 1, 9–32 (1995).
Chandru, V., Lee, C.Y., Uzsoy, R., “Minimizing Total Completion Time on Batch Processing Machines”, International Journal of Production Research 31, 2097–2121 (1993a).
Chandru, V., Lee, C.Y., Uzsoy, R., “Minimizing Total Completion Time on a Batch Processing Machine with Job Families”, Operations Research Letters 13, 61–65 (1993b).
Gary, K., Kempf, K., Smith, S., Uzsoy, R., “Assessing the Quality of Production Schedules”, in Intelligent Scheduling Systems, Scherer, W. Brown, D. (eds.), Kluwer Academic Publishing, 129–154 (1995).
Geiger, C.D., Kempf, K.G., Uzsoy, R., “A Tabu Search Approach to Scheduling an Automated Wet Etch Station”, Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN 47907–1287 (1996).
Hooker, J., “Needed: An Empirical Science of Algorithms”, Operations Research 42, 201–212 (1994).
Hooker, J., “Testing Heuristics: We Have It All Wrong”, Journal of Heuristics 1, 33–42 (1995).
Kondili, E., Pantelides, C.C., Sargent, R.W.H., “A General Algorithm for Short-Term Scheduling of Batch Operations - I: MILP Formulation”, Computers in Chemical Engineering 17, 211–227 (1993).
Lee, C.Y., Uzsoy, R., Martin-Vega, L.A., “Efficient Algorithms for Scheduling Semiconductor Burn-in Operations”, Operations Research 40, 764–775 (1992).
Mehta, S.V., Uzsoy, R., “Minimizing Total Tardiness on a Batch Processing Machine with Incompatible Job Families”, Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN 47907–1287 (1995a).
Mehta, S.V., Uzsoy, R., “Predictable Single-Machine Scheduling in the Presence of Machine Breakdowns”, Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN 47907–1287 (1995b).
Mehta, S.V., Uzsoy, R., “Predictable Scheduling of a Job Shop Environment Subject to Breakdowns”, Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN 47907–1287 (1996).
Shah, N., Pantelides, C.C., Sargent, R.H.W., “A General Algorithm for Short-Term Scheduling of Batch Operations - II: Computational Issues”, Computers in Chemical Engineering 17, 229–244 (1993).
Uzsoy, R., “Scheduling a Single Batch Processing Machine with Nonidentical Job Sizes”, International Journal of Production Research 32, 1615–1635 (1994).
Uzsoy, R., “Scheduling Batch Processing Machines with Incompatible Job Families”, International Journal of Production Research 33, 2605–2708 (1995).
Uzsoy, R., Yang, Y., “Minimizing Total Weighted Completion Time on a Single Batch Processing Machine”, Production and Operations Management, forthcoming.
Kempf, K., Uzsoy, R., Wang, C.-S., “Scheduling a Single Batch Processing Machine with Secondary Resource Constraints”, Research Report, School of Industrial Engineering, Purdue University, West Lafayette, IN 47907–1287 (1996).
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). Conclusions and Future Directions. In: Decomposition Methods for Complex Factory Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6329-7_13
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6329-7_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7906-5
Online ISBN: 978-1-4615-6329-7
eBook Packages: Springer Book Archive