A computational study of a shifting bottleneck heuristic for multi-product complex job shops

Production Planning and Control

Volumn 22, Issue 1, 2011, Pages 25-40

  Mönch, Lars ^a   Zimmermann, Jens ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

discrete event simulation; multi product environment; performance assessment; semiconductor manufacturing; shifting bottleneck heuristic

Indexed keywords

COMPUTATIONAL STUDIES; DISPATCHING RULES; DYNAMIC ENVIRONMENTS; JOB SHOP; MANUFACTURING SYSTEM; MULTI-PRODUCTS; PERFORMANCE ASSESSMENT; PERFORMANCE EVALUATION; ROLLING HORIZON; SCHEDULING PROBLEM; SEMICONDUCTOR MANUFACTURING; SEMICONDUCTOR WAFER FABRICATION; SHIFTING BOTTLENECK HEURISTIC; SIMULATION EXPERIMENTS; TOTAL-WEIGHTED TARDINESS; WAFER-FABS;

COMPUTER SIMULATION; INDUSTRIAL APPLICATIONS; RATING; SCHEDULING; SEMICONDUCTOR DEVICE MANUFACTURE; SEMICONDUCTOR METAL BOUNDARIES; SILICON WAFERS;

QUALITY CONTROL;

EID: 78650621042     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/09537287.2010.490015     Document Type: Article

References (43)

1. Adams, J., Balas, E., and Zawack, D., 1988. The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. Angrawal, G.K. and Heragu, S.S., 2006. A survey on automated material handling systems in 300mm semiconductor fabs. IEEE Transactions on Semiconductor Manufacturing, 19 (1), 112-119.
3. Atherton, L.F. and Atherton, R.W., 1995. Wafer fabrication: factory performance and analysis. Boston: Kluwer Academic Publishers.
4. Bahaji, N. and Kuhl, M.E., 2008. A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication. International Journal of Production Research, 46 (14), 3801-3824.
5. Barua, A., et al., 2005. Implementing global factory schedules in the face of stochastic disruptions. International Journal of Production Research, 43 (4), 94-109.
6. Demirkol, E., Mehta, S., and Uzsoy, R., 1997. A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3, 111-137.
7. Demirkol, E. and Uzsoy, R., 2000. Decomposition methods for reentrant flow shops with sequence dependent setuptimes. Journal of Scheduling, 3, 155-177.
8. Essafi, I., Mati, Y., and Dauzère-Pérè z, S., 2008. A genetic local search algorithm for minimizing total weighted tardiness in the job shop scheduling problem. Computers and Operations Research, 35 (8), 2599-2616.
9. Fowler, J.W., Mönch, L., and Rose, O., 2006. Scheduling and simulation. In: J. Herrmann, ed. Handbook of production scheduling. New York: Springer, 109-133.
10. Fowler, J.W. and Robinson, J., 1995. Measurement and improvement of manufacturing capacities (MIMAC): final report. Technical Report 95062861A-TR. Austin, TX: SEMATECH.
11. Graham, R.L., et al., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
12. Habenicht, I. and Mönch, L., 2004. Evaluation of batching strategies in a multi-product waferfab by discrete-event simulation. In: Proceedings of the 16th European simulation symposium (ESS) 2004, Budapest, Hungary, 23-28.
13. Huang, K.-H. and Liao, C.-J., 2008. Ant colony optimization with taboo search for the job shop scheduling problem. Computers and Operations Research, 35 (4), 1030-1046.
14. Ivens, P. and Lambrecht, M., 1996. Extending the shifting bottleneck procedure to real-life applications. European Journal of Operational Research, 90, 252-268.
15. Kanet, J.J. and Li, X., 2004. A weighted modified due date rule for sequencing to minimize weighted tardiness. Journal of Scheduling, 7, 261-276.
16. Kuhl, M.E. and Laubisch, R.G., 2004. A simulation study of dispatching rules and rework strategies in semiconductor manufacturing. In: Proceedings of the 2004 IEEE/SEMI Advanced Semiconductor Manufacturing Conference, 4-6 May. Boston, USA: IEEE, 325-329.
17. Lawler, E.L., 1977. A ''pseudopolynomial'' time algorithm for sequencing jobs to minimize total weighted tardiness. Annals of Discrete Mathematics, 1, 331-342.
18. Mason, S., Fowler, J.W., and Carlyle, W.M., 2002. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5, 247-262.
19. Mason, S., et al., 2005. Heuristic for minimizing total weighted tardiness in complex job shops. International Journal of Production Research, 43 (10), 1943-1963.
20. Mönch, L. and Driessel, R., 2005. A distributed shifting bottleneck heuristic for complex job shops. Computers and Industrial Engineering, 49, 673-680.
21. Mönch, L., Rose, O., and Sturm, R., 2003. A simulation framework for performance assessment of shop-floor control systems. Simulation: Transactions of the Society of Modeling and Computer Simulation International, 79 (3), 163-170.
22. Mönch, L., et al., 2007. Genetic algorithm based subproblem solution procedure for the modified shifting bottleneck heuristic for complex job shops. European Journal of Operational Research, 177 (3), 2100-2118.
23. Nowicki, E. and Smutnicki, C., 2005. An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8, 145-159.
24. Ovacik, I.M. and Uzsoy, R., 1997. Decomposition methods for complex factory scheduling problems. Boston: Kluwer Academic Publishers.
25. Pabst, D., 2003. Handling precedence constraints for the shifting bottleneck heuristic applied in a dynamic semiconductor manufacturing environment. Thesis (MS). Universität Würzburg, Würzburg.
26. Pfund, M., Mason, S., and Fowler, J.W., 2006. Dispatching and scheduling in semiconductor manufacturing, In: J. Herrmann, ed. Handbook of production scheduling. Heidelberg: Springer, 213-241.
27. Pinedo, M., 2002. Scheduling: theory, algorithms, and systems. 2nd ed. New Jersey: Prentice-Hall.
28. Pinedo, M. and Singer, A., 1999. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46, 1-17.
29. Potts, C.N. and Kovalyov, M.Y., 2000. Scheduling with batching: a review. European Journal of Operational Research, 120, 228-249.
30. Qu, P., Steinmiller, B., and Mason, S., 2003. Incorporating automated material handling systems into a disjunctive graph. In: Proceedings of the 12th Industrial Engineering Research Conference, 18-21 May, Portland, OR.
31. Rose, O., 2002. Some issues of the critical ratio dispatch rule in semiconductor manufacturing. In: Proceedings of the 2002 Winter Simulation Conference, 8-11 December, San Diego, USA, 1401-1405.
32. Schömig, A. and Fowler, J.W., 2000. Modeling semiconductor manufacturing operations. In: K. Mertins and M. Rabe, eds. Proceedings of the 9th ASIM dedicated conference simulation in production and logistics, 8-9 March, Berlin, Germany, 55-64.
33. Sevkli, M. and Aydin, M.E., 2006. A variable neighbourhood search algorithm for job shop scheduling problems. In: Proceedings EvoCOP 2006, LNCS 3906, 10-12 April, Budapest, Hungary, 261-271.
34. Sourirajan, K. and Uzsoy, R., 2007. Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. Journal of Scheduling, 10, 41-65.
35. Upasani, A. and Uzsoy, R., 2008. Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study. International Journal of Production Research, 46 (21), 5883-5905.
36. Upasani, A., Uzsoy, R., and Sourirajan, K., 2006. A problem reduction approach for scheduling semiconductor wafer fabrication facilities. IEEE Transactions on Semiconductor Manufacturing, 19 (2), 216-225.
37. Uzsoy, R., Lee, C.-Y., and Martin-Vega, L.A., 1994. A review of production planning and scheduling models in the semiconductor industry. Part II: shop floor control. IIE Transactions, 26, 44-55.
38. Uzsoy, R. and Wang, C.-S., 2000. Performance of decomposition procedures for job-shop scheduling problems with bottleneck machines. International Journal of Production Research, 38, 1271-1286.
39. Varadarajan, A. and Sarin, S.C., 2006. A survey of dispatching rules for operational control in wafer fabrication. In: Proceedings of the INCOM 2006, 17-19 May, Saint-Etienne, France, 715-726.
40. Vepsalainen, A. and Morton, T.E., 1987. Priority rules and lead time estimate for job shop scheduling with weighted tardiness costs. Management Science, 33, 1036-1047.
41. Zhang, C.Y., et al., 2008. A very fast TS/SA algorithm for the job shop scheduling problem. Computers and Operations Research, 35 (1), 282-294.
42. Zimmermann, J. and Mönch, L., 2006. Performance assessment of a shifting bottleneck heuristic in a multi-product wafer fab by discrete event simulation. In: Proceedings Industrial Simulation Conference, 5-7 June, Palermo, Italy, 314-318.
43. Zoghby, J., Barnes, J.W., and Hasenbein, J.J., 2005. Modeling the reentrant job shop scheduling problem with set-ups for metaheuristic searches. European Journal of Operational Research, 167, 336-348.