Setup Change Scheduling for Semiconductor Packaging Facilities Using a Genetic Algorithm With an Operator Recommender

Semiconductor manufacturers are increasingly assembling multiple chips into a single package to maximize the capacity of flash memories. Multiple-chip products (MCPs) require repetitive visits to assembly stages and incur frequent setup changes. As utilization of packaging facilities decreases due to the introduction of MCPs, research on scheduling of packaging facilities is becoming more important than ever. In this paper, we propose a novel framework to find a good schedule for semiconductor packaging facilities by focusing on bottleneck stages while satisfying practical operational constraints. A genetic algorithm-based sequence optimizer is employed, and construction and performance evaluation of a schedule are separately addressed by a simulator. Furthermore, a recommender is proposed to accelerate convergence of the optimizer. Experimental results show that the proposed approach performs better than the other existing methods while successfully reducing computation time.

[1]  Sang-Jin Lee,et al.  Scheduling a multi-chip package assembly line with reentrant processes and unrelated parallel machines , 2008, 2008 Winter Simulation Conference.

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

[3]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[4]  Jean-Charles Billaut,et al.  A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem , 2008, Eur. J. Oper. Res..

[5]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[6]  MengChu Zhou,et al.  Deadlock-Free Genetic Scheduling Algorithm for Automated Manufacturing Systems Based on Deadlock Control Policy , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  MengChu Zhou,et al.  A Petri-Net-Based Scheduling Strategy for Dual-Arm Cluster Tools With Wafer Revisiting , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[8]  Mike Tao Zhang,et al.  Dynamic capacity modeling with multiple re-entrant workflows in semiconductor assembly manufacturing , 2005, IEEE International Conference on Automation Science and Engineering, 2005..

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

[10]  L. Li,et al.  Adaptive Dispatching Rule for Semiconductor Wafer Fabrication Facility , 2013, IEEE Transactions on Automation Science and Engineering.

[11]  Dana Vrajitoru,et al.  Large Population or Many Generations for Genetic Algorithms? Implications in Information Retrieval , 2000 .

[12]  Yumin Deng,et al.  Scheduling Back-End Operations in Semiconductor Manufacturing , 2010, IEEE Transactions on Semiconductor Manufacturing.

[13]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[14]  Kairon Freitas Guimaraes,et al.  An Approach for Flexible Job-Shop Scheduling with Separable Sequence-Dependent Setup Time , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

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

[16]  Fei Qiao,et al.  A Petri Net and Extended Genetic Algorithm Combined Scheduling Method for Wafer Fabrication , 2013, IEEE Transactions on Automation Science and Engineering.

[17]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[18]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[19]  Rainer Kolisch,et al.  Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem , 1995 .

[20]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[21]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[22]  Ferdinando Pezzella,et al.  An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem , 2010, Eur. J. Oper. Res..

[23]  Mikkel T. Jensen,et al.  Generating robust and flexible job shop schedules using genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[24]  Serge Domenech,et al.  A two-stage methodology for short-term batch plant scheduling , 1998 .

[25]  Mostafa Zandieh,et al.  Flexible job-shop scheduling with parallel variable neighborhood search algorithm , 2010, Expert Syst. Appl..

[26]  Wojciech Bozejko,et al.  Parallel hybrid metaheuristics for the flexible job shop problem , 2010, Comput. Ind. Eng..

[27]  R. C. Leachman,et al.  Stochastic wafer fabrication scheduling , 2003 .

[28]  Fei Qiao,et al.  Single Machine Oriented Match-Up Rescheduling Method for Semiconductor Manufacturing System , 2012, ICIRA.

[29]  Richard A. Wysk,et al.  An application of discrete-event simulation to on-line control and scheduling in flexible manufacturing , 1989 .

[30]  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.

[31]  Yang Song,et al.  Bottleneck Station Scheduling in Semiconductor Assembly and Test Manufacturing Using Ant Colony Optimization , 2007, IEEE Transactions on Automation Science and Engineering.

[32]  Jonathan F. Bard,et al.  Daily scheduling of multi-pass lots at assembly and test facilities , 2013 .

[33]  Mingyuan Chen,et al.  A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups , 2010 .

[34]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[35]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..