Abstract
The basic thesis of this work, as mentioned in the previous chapter, is the need for research applying the extensive body of knowledge developed by scheduling research to actual industrial problems. It is thus necessary to start from an industrial problem, develop an acceptable formulation as a scheduling problem and relate it to the existing body of theory. In this work, the motivating industrial applications are drawn from the semiconductor industry. Hence in this chapter we describe the industrial environment, formulate a job shop scheduling problem, discuss the limitations of this formulation and relate it to existing literature. We then describe the decomposition approach we suggest and motivate its use in this environment.
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).
Applegate, D., Cook, W., “A Computational Study of the Job Shop Scheduling Problem”, ORSA Journal on Computing 3, 149–156 (1991).
Balas, E., “Machine Sequencing via Disjunctive Graphs: An Implicit Enumeration Approach”, Operations Research 17, 941–957 (1969).
Balas, E., Lenstra, J.K., Vazacopoulos, A., “One Machine Scheduling with Delayed Precedence Constraints”, Management Science 41, 94–109 (1995).
Bazaraa, M.S., Jarvis, J.J., Linear Programming and Network Flows, John Wiley, New York (1977).
Bhaskaran, K., Pinedo, M., “Dispatching”, Chapter 83 of Handbook of Industrial Engineering, G. Salvendy(ed.), Wiley, New York (1991).
Blackstone, J.H., Phillips, D.T., Hogg, G.L., “A State-of-the-Art Survey of Dispatching Rules for Manufacturing Job Shop Operations”, International Journal of Production Research 20, 27–45 (1982).
Carlier, J., “The One-Machine Scheduling Problem”, European Journal of Operational Research 11, 42–47 (1982).
Carlier, J., Pinson, E., “An Algorithm for Solving the Job-Shop Problem”, Management Science 35, 164–176 (1989).
Charlton, J.M., Death, C.C., “A Method of Solution for General Machine Scheduling Problems”, Operations Research 18, 689–707 (1970).
Consilium Inc., Short-Interval Scheduling System User’s Manual, Internal Publication, Mountain View, CA (1988).
Dauzere-Peres, S., Lasserre, J.B., “A Modified Shifting Bottleneck Procedure for Job Shop Scheduling”, International Journal of Production Research 31, 923–932 (1993).
Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman, San Francisco (1979).
Goldraft, E.M., The Goal: A Process of Ongoing Improvement, North River Press (1986).
Harrison, J.M., Holloway, C.A., Patell, J.M., “Measuring Delivery Performance: A Case Study from the Semiconductor Industry”, in Measures for Manufacturing Excellence, R.S. Kaplan (ed.), Harvard Business School Press (1990).
Hughes, R.A., Shott, J.D., “The Future of Automation for High-Volume Wafer Fabrication and ASIC Manufacturing”, Proceedings of the IEEE 74, 1775–1793 (1986).
Kempf, K., Russell, B., Sidhu, S., Barrett, S., “Artificially Intelligent Schedulers in Manufacturing Practice”, Al Magazine 11 No.5, 46–56 (1991).
Lambrecht, M.R., Ivens, P.L., Vandaele, N.J., “Clips: A Capacity and Lead-Time Integrated Procedure for Scheduling”, Research Report, Department of Applied Economics, Katholieke Universiteit Leuven (1996).
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and 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).
Levinstein, H.J., “White Paper on IC Fabrication in the Year 2000”, Research Report T90150, Semiconductor Research Corporation, Research Triangle Park, NC 27709 (1990).
Matsuo, H., Suh, C.J., Sullivan, R.S., “A Controlled Search Simulated Annealing Method for the General Jobshop Scheduling Problem”, Working Paper 03–04–88, Department of Management, University of Texas at Austin (1988).
Morton, T.E., Rachamadugu, R.M., Vepsalainen, A., “Accurate Myopic Heuristics for Tardiness Scheduling”, W.P. #36–83–84, Graduate School of Business Administration, Carnegie Mellon University, Pittsburgh, PA (1984).
Panwalkar, S.S., Iskander, W., “A Survey of Scheduling Rules”, Operations Research 25, 45–61 (1977).
Pinedo, M., Scheduling: Theory, Algorithms and Systems, Prentice Hall, New York (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).
Rachamadugu, R., Stecke K.E., “Classification and Review of FMS Scheduling Procedures”, Research Report, School of Business Administration, University of Michigan, Ann Arbor, MI (1989).
Reid, B.K., Short, J.D., Meindl, J.D., “Wafer Fabrication and Process Automation Research at Stanford University”, Solid State Technology 126–133 (1984).
Runyan, W.R., Bean, K.E., Semiconductor Integrated Circuit Processing Technology, Addison-Wesley, Reading, MA (1990).
Sadeh, N., Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling, Ph.D. Thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA (1991).
Schutten, J.M.J., “Practical Job Shop Scheduling”, Research Report, Department of Mechanical Engineering, University of Twente (1995).
Serafini, P., Ukovich, W., Kirchner, H., Giardina, F., Tiozzo, F., “Job Shop Scheduling: A Case Study”, in Operations Research Models in FMS, F. Archetti, M. Lucertini and P. Seraflni (eds.), Springer-Verlag (1988).
Silver, E.A., Vidal, R.V.V., De Werra, D., “A Tutorial on Heuristic Methods”, European Journal of Operational Research 5, 153–162 (1980).
Simon, H.A., The Sciences of the Artificial, 2nd Edition, The MIT Press, Cambridge, MA (1981). Sze, S.M., VLSI Technology, McGraw-Hill, New York (1988).
Uzsoy, R., Lee, C.Y., Martin-Vega, L.A., “A Review of Production Planning and Scheduling Models in the Semiconductor Industry Part I: System Characteristics, Performance Evaluation and Production Planning”, IIE Transactions on Scheduling and Logistics 24, 47–61 (1992).
Uzsoy, R., Lee, C.Y., Martin-Vega, L.A., “A Review of Production Planning and Scheduling Models in the Semiconductor Industry Part II: Shop-Floor Control”, IIE Transactions on Scheduling and Logistics 26, 44–55 (1994).
Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K., “Job Shop Scheduling by Simulated Annealing”, Operations Research 40, 113–125 (1992).
Vepsalainen, A.P.J., 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).
Wise, K.D., “Automation in Semiconductor Manufacturing”, Research Report T91014, Semiconductor Research Corporation, Research Triangle Park, NC 27709 (1990).
Yoo, W.S., Martin-Vega, L.A., “A Decomposition Methodology for Scheduling Semiconductor Testing Operation for Number of Tardy Job Measures”, Research Report, Department of Computer Science, Utah State University (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). Industrial Context and Motivation of Decomposition Methods. In: Decomposition Methods for Complex Factory Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6329-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6329-7_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7906-5
Online ISBN: 978-1-4615-6329-7
eBook Packages: Springer Book Archive