Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing

Abstract This study presents a simulation optimization approach for a hybrid flow shop scheduling problem in a real-world semiconductor back-end assembly facility. The complexity of the problem is determined based on demand and supply characteristics. Demand varies with orders characterized by different quantities, product types, and release times. Supply varies with the number of flexible manufacturing routes but is constrained in a multi-line/multi-stage production system that contains certain types and numbers of identical and unrelated parallel machines. An order is typically split into separate jobs for parallel processing and subsequently merged for completion to reduce flow time. Split jobs that apply the same qualified machine type per order are compiled for quality and traceability. The objective is to achieve the feasible minimal flow time by determining the optimal assignment of the production line and machine type at each stage for each order. A simulation optimization approach is adopted due to the complex and stochastic nature of the problem. The approach includes a simulation model for performance evaluation, an optimization strategy with application of a genetic algorithm, and an acceleration technique via an optimal computing budget allocation. Furthermore, scenario analyses of the different levels of demand, product mix, and lot sizing are performed to reveal the advantage of simulation. This study demonstrates the value of the simulation optimization approach for practical applications and provides directions for future research on the stochastic hybrid flow shop scheduling problem.

[1]  Felix T. S. Chan,et al.  A genetic algorithm-based scheduler for multiproduct parallel machine sheet metal job shop , 2011, Expert Syst. Appl..

[2]  W.L. Pearn,et al.  Scheduling Integrated Circuit Assembly Operations on Die Bonder , 2007, IEEE Transactions on Electronics Packaging Manufacturing.

[3]  Qi Li,et al.  Hierarchical Capacity Planning With Reconfigurable Kits in Global Semiconductor Assembly and Test Manufacturing , 2007, IEEE Transactions on Automation Science and Engineering.

[4]  Ling-Huey Su,et al.  Infinite capacity planning for IC packaging plants , 2010 .

[5]  Taho Yang,et al.  Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: integrated-circuit wire bonding , 2012 .

[6]  Chun-Hung Chen,et al.  Optimal computing budget allocation for Monte Carlo simulation with application to product design , 2003, Simul. Model. Pract. Theory.

[7]  John W. Fowler,et al.  Framework for execution level capacity allocation decisions for Assembly - Test facilities using integrated optimization - simulation models , 2008, 2008 Winter Simulation Conference.

[8]  Subhash C. Sarin,et al.  A review of lot streaming , 2013 .

[9]  Li Zheng,et al.  Multi-factory capacity planning in semiconductor assembly and test manufacturing with multiple-chip products , 2006, 2006 IEEE International Conference on Automation Science and Engineering.

[10]  Jose A. Ventura,et al.  A new genetic algorithm for lot-streaming flow shop scheduling with limited capacity buffers , 2013, J. Intell. Manuf..

[11]  H. S. Booker,et al.  Research Methods for the Behavioral Sciences , 2020 .

[12]  Loo Hay Lee,et al.  Stochastic Simulation Optimization - An Optimal Computing Budget Allocation , 2010, System Engineering and Operations Research.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Bernd Scholz-Reiter,et al.  Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems , 2013 .

[15]  Jürgen Branke,et al.  Integrating Techniques from Statistical Ranking into Evolutionary Algorithms , 2006, EvoWorkshops.

[16]  Jürgen Branke,et al.  Selecting a Selection Procedure , 2007, Manag. Sci..

[17]  Liang Gao,et al.  Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects , 2011 .

[18]  Yin Xiao-Feng,et al.  A rule-based heuristic finite capacity scheduling system for semiconductor backend assembly , 2004 .

[19]  Daniel Quadt,et al.  Production planning in semiconductor assembly , 2003 .

[20]  Jie Li,et al.  Simulation-Based Discrete Optimization of Stochastic Discrete Event Systems Subject to Non Closed-Form Constraints , 2009, IEEE Transactions on Automatic Control.

[21]  MengChu Zhou,et al.  Virtual production lines design for back-end semiconductor manufacturing systems , 2003 .

[22]  Paul R. Drake,et al.  Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms , 2009 .

[23]  Lionel Amodeo,et al.  A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times , 2006 .

[24]  Jürgen Branke,et al.  Evolutionary search for difficult problem instances to support the design of job shop dispatching rules , 2011, Eur. J. Oper. Res..

[25]  Frank Werner,et al.  A heuristic algorithm for minimizing mean flow time with unit setups , 2001, Inf. Process. Lett..

[26]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[27]  John W. Fowler,et al.  A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations , 2011, J. Sched..

[28]  Andreas Klemmt,et al.  An optimization approach for parallel machine problems with dedication constraints: Combining simulation and capacity planning , 2011, Proceedings of the 2011 Winter Simulation Conference (WSC).

[29]  Andreas Klemmt,et al.  Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility , 2009 .

[30]  Jose M. Framiñan,et al.  Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective , 2010, Comput. Oper. Res..

[31]  T. X. Cai,et al.  An intelligent multi-constraint finite capacity-based lot release system for semiconductor backend assembly environment , 2007 .

[32]  Taïcir Loukil,et al.  A genetic algorithm for robust hybrid flow shop scheduling , 2011, Int. J. Comput. Integr. Manuf..

[33]  Monaldo Mastrolilli,et al.  On-line scheduling to minimize max flow time: an optimal preemptive algorithm , 2005, Oper. Res. Lett..

[34]  Mustafa Y. Sir,et al.  Multi-objective simulation optimization using data envelopment analysis and genetic algorithm: Specific application to determining optimal resource levels in surgical services , 2013 .

[35]  A. I. Sivakumar,et al.  Multiobjective dynamic scheduling using discrete event simulation , 2001, Int. J. Comput. Integr. Manuf..

[36]  Amir Azaron,et al.  A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms , 2007, Eur. J. Oper. Res..

[37]  A.I. Sivakumar,et al.  Online multiobjective Pareto optimal dynamic scheduling of semiconductor back-end using conjunctive simulated scheduling , 2006, IEEE Transactions on Electronics Packaging Manufacturing.

[38]  Loo Hay Lee,et al.  Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem , 2008, Eur. J. Oper. Res..

[39]  Chun-Hung Chen,et al.  A Review of Optimal Computing Budget Allocation Algorithms for Simulation Optimization Problem , 2010 .

[40]  Rubén Ruiz,et al.  Modeling realistic hybrid flexible flowshop scheduling problems , 2008, Comput. Oper. Res..

[41]  G. Rand Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[42]  Danny J. Johnson,et al.  A framework for reducing manufacturing throughput time , 2003 .

[43]  Ihsan Sabuncuoglu,et al.  Simulation optimization: A comprehensive review on theory and applications , 2004 .

[44]  Richard F. Hartl,et al.  A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer , 2013 .

[45]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[46]  Jürgen Branke *,et al.  Anticipation and flexibility in dynamic scheduling , 2005 .

[47]  Yolanda Carson,et al.  Simulation optimization: methods and applications , 1997, WSC '97.

[48]  T. X. Cai,et al.  Practical lot release methodology for semiconductor back-end manufacturing , 2005 .

[49]  John W. Fowler,et al.  Using simulation-based scheduling to maximize demand fulfillment in a semiconductor assembly facility , 2002, Proceedings of the Winter Simulation Conference.

[50]  Chun-Hung Chen,et al.  Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..

[51]  W. Melville Arnott,et al.  Survey of the problem , 1960 .

[52]  Loo Hay Lee,et al.  Advances in simulation optimization and its applications , 2013 .

[53]  Moeed Haghnevis,et al.  Batch Production Scheduling for Semiconductor Back-End Operations , 2011, IEEE Transactions on Semiconductor Manufacturing.

[54]  Rubén Ruiz,et al.  A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times , 2011, Eur. J. Oper. Res..

[55]  Wenjing Yan,et al.  An integrated modeling framework for capacity planning and production scheduling , 2005, 2005 International Conference on Control and Automation.