Abstract
The main goal of this research, as discussed in Chapter 2, is to develop effective decomposition procedures to minimize Lmax in complex job shops of the type encountered in semiconductor testing and wafer fabrication facilities. In the workcenter-based approach we have followed, a key subproblem is that of minimizing Lmax on a workcenter consisting of a single machine, or parallel identical machines, in the presence of sequence-dependent setup times. These problems are strongly NP-hard, and are thus of considerable interest in their own right, apart from their importance in developing effective decomposition procedures for the overall job shop problem. Experiments with generic decomposition procedures in Chapters 5 and 6 have shown that the quality of the subproblem solutions has a significant effect on the quality of the solution obtained for the overall problem. Hence it is desirable to develop heuristics that generate higher-quality solutions in reasonable computation times.
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
Baker, K.R., Introduction to Sequencing and Scheduling, John Wiley, New York (1974).
Balas, E, Toth, P., “Branch and Bound Methods”, in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.), Wiley, New York (1985).
Carlier, J., “The One-Machine Scheduling Problem”, European Journal of Operational Research 11, 42–47 (1982).
Fowler, J.W., Hogg, G.L., Philips, D.T., “Control of Multiproduct Bulk Service Diffusion/Oxidation ProrPeceç”, IIE Transactions on Scheduling and Logistics 24, 84–96 (1992).
Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman, San Francisco (1979).
Glassey, C.R., Weng, W.W., “Dynamic Batching Heuristic for Simultaneous Processing”, IEEE Transactions on Semiconductor Manufactu ring 4, 77–82 (1991).
Hall, L., Shmoys, D., “Jackson’s Rule for One-Machine Scheduling: Making a Good Heuristic Better”, Mathematics of Operations Research 17, 22–35 (1992).
Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G., “Minimizing Maximum Lateness on One Machine: Computational Experience and Some Applications”, Statistica Neerlandica 30, 25–41 (1976).
Lawler, E.L., “Optimal Sequencing of a Single Machine Subject to Precedence Constraints”, Management Science 19, 544–546 (1973).
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., “Sequencing and Scheduling: Algorithms and Complexity”, 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).
McMahon, G., Florian, M., “On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness”, Operations Research 23, 475–482 (1975).
Monma, C., Potts, C.N., “On the Complexity of Scheduling with Batch Setup Times”, Operations Research 37, 798–804 (1989).
Morton, T.E., “Forward Algorithms for Forward-Thinking Managers”, in Applications of Management Science, R.L. Schulz (ed.), JAI Press Inc, Greenwich, CT (1981).
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).
Parker, R.G., Rardin, R.L., Discrete Optimization, Academic Press, San Diego (1988).
Picard, J.C., Queyranne, M., “The Time-Dependent Travelling Salesman Problem and its Application to the Tardiness Problem in One-Machine Scheduling”, Operations Research 26, 86–110 (1978).
Potts, C.N., “Analysis of a Heuristic for One Machine Sequencing With Release Dates and Delivery Times”, Operations Research 28, 1436–1441 (1980).
Sahni, S., Gonzalez, T., “P-Complete Approximation Problems”, Journal of the Association for Computing Machinery 23, 555–565 (1976).
Schutten, J.M.J., van de Velde, S.L., Zijm, W.H., “Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times”, Management Science (forthcoming).
Unal, A.T., Kiran A.S., “Batch Sequencing”, HE Transactions on Scheduling and Logistics 24, 73–83 (1992).
Uzsoy, R., Martin-Vega, L.A., Lee, C.Y., Leonard, P.A., “Production Scheduling Algorithms for a Semiconductor Test Facility”, IEEE Transactions on Semiconductor Manufacturing 4, 270–280 (1991).
Uzsoy, R., Lee, C.Y., Martin-Vega, L.A., “Scheduling Semiconductor Test Operations: Minimizing Maximum Lateness and Number of Tardy Jobs on a Single Machine”, Naval Research Logistics 39, 369–388 (1992).
Uzsoy, R., Church, L.K., Ovacik, I.M., Hinchman, J., “Performance Evaluation of Dispatching Rules for Semiconductor Testing Operations”, Journal of Electronics Manufacturing 3, 95–105 (1993).
Zdrzalka, S., “Preemptive Scheduling with Release Dates, Delivery Times and Sequence Independent Setup Times”, Institute of Engineering Cybernetics, Technical University of Wroclaw, Wroclaw, Poland (1992).
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). Time-Based Decomposition Procedures for Single-Machine Subproblems. In: Decomposition Methods for Complex Factory Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6329-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6329-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7906-5
Online ISBN: 978-1-4615-6329-7
eBook Packages: Springer Book Archive