A review of the research methodology for the re-entrant scheduling problem

This paper considers the re-entrant scheduling problem, wherein the most remarkable character is that the jobs enter the processing lines more than once. The objective is to provide a comprehensive review which gives the researchers and practitioners an overview of the applicability of techniques in re-entrant scheduling. Few published reviews dealt with this particular kind of problem and only some research regards the re-entrant character as a hypotaxis of their main problems. This paper is the first paper that gives a full picture of the re-entrant scheduling problem. Considered as a NP-hard problem, a growing number of researchers have employed various methods to solve this complex problem. A survey has been conducted from the recently published literature on the re-entrant problem. This paper has summarised the problem and the relative research methodologies have been studied. Mathematical methods and meta-heuristics, especially Petri net, dispatching rules and genetic algorithm, emerge as the most frequently used methods in recent years, which are presented in detail. Moreover, future research implications have been identified and are suggested. It may help to bring in more awareness of the problem and new techniques to solve it.

[1]  Cheng Wu,et al.  Genetic algorithm using sequence rule chain for multi-objective optimization in re-entrant micro-electronic production line , 2004 .

[2]  Jen-Shiang Chen,et al.  Hybrid tabu search for re-entrant permutation flow-shop scheduling problem , 2008, Expert Syst. Appl..

[3]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[4]  Chien-Min Lin,et al.  A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem , 2008, Expert Syst. Appl..

[5]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[6]  Fu-Kwun Wang,et al.  Capacity-constrained scheduling for a logic IC final test facility , 2004 .

[7]  Zhibin Jiang,et al.  Simulation-based optimization of dispatching rules for semiconductor wafer fabrication system scheduling by the response surface methodology , 2009 .

[8]  Zuhua Jiang,et al.  The infrastructure of the timed EOPNs-based multiple-objective real-time scheduling system for 300 mm wafer fab , 2007 .

[9]  A. Barua,et al.  Implementing global factory schedules in the face of stochastic disruptions , 2005 .

[10]  Yoni Nazarathy,et al.  Near optimal control of queueing networks over a finite time horizon , 2009, Ann. Oper. Res..

[11]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[12]  S.-W. Choi,et al.  Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop , 2003 .

[13]  J. U. Sun,et al.  A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times , 2009 .

[14]  Jonathan F. Bard,et al.  AN OPTIMIZATION APPROACH TO CAPACITY EXPANSION IN SEMICONDUCTOR MANUFACTURING FACILITIES , 1999 .

[15]  Yohanan Arzi,et al.  Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times , 1998 .

[16]  Peter L. Jackson,et al.  Finding minimum flow time cyclic schedules for non-identical, multistage jobs , 2008 .

[17]  Wen Lea Pearn,et al.  Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes , 2009 .

[18]  Mohamed Khaled Omar,et al.  Performance analysis in a re-entrant operation with combinational routing and yield probabilities , 2009 .

[19]  Tae-Eog Lee,et al.  Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots , 2007 .

[20]  M. K. Tiwari,et al.  Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability , 2004 .

[21]  Y. Narahari,et al.  Performance analysis of scheduling policies in re-entrant manufacturing systems , 1996, Comput. Oper. Res..

[22]  Hsin Rau,et al.  Genetic algorithm modeling for the inspection allocation in reentrant production systems , 2009, Expert Syst. Appl..

[23]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

[24]  Young Hoon Lee,et al.  Push-pull production planning of the re-entrant process , 2003 .

[25]  Chih-Ming Hsu,et al.  Mathematical modelling of multi-objective job shop scheduling with dependent setups and re-entrant operations , 2005 .

[26]  Huiran Liu,et al.  Modeling of large-scale complex re-entrant manufacturing systems by extended object-oriented Petri nets , 2005 .

[27]  Manoj Kumar Tiwari,et al.  Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing , 2003 .

[28]  Nicholas G. Odrey,et al.  A generalized Petri net modeling approach for the control of re-entrant flow semiconductor wafer fabrication , 2001 .

[29]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[30]  Andrew N. Hrymak,et al.  Scheduling of the batch annealing process — deterministic case , 1999 .

[31]  Scott J. Mason,et al.  Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines , 2009 .

[32]  Yeong-Dae Kim,et al.  Minimizing total tardiness on a two-machine re-entrant flowshop , 2009, Eur. J. Oper. Res..

[33]  David Stockton,et al.  Control point policy: part 1–efficiency within make-to-order environments , 2008 .

[34]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[35]  Jeffery K. Cochran,et al.  Two-stage simulation optimization for agile manufacturing capacity planning , 2003 .

[36]  Jen-Shiang Chen,et al.  Integer programming models for the re-entrant shop scheduling problems , 2006 .

[37]  Arianna Alfieri,et al.  Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study , 2009 .

[38]  J. Zhang,et al.  Multiagent-based modeling for re-entrant manufacturing system , 2007 .

[39]  Daniel E. Rivera,et al.  Multilayer optimization and scheduling using model predictive control: application to reentrant semiconductor manufacturing lines , 2000 .

[40]  J. C. Chen *,et al.  Dynamic state-dependent dispatching for wafer fabrication , 2004 .

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

[42]  A. Upasani,et al.  Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study , 2008 .

[43]  P. R. Kumar,et al.  Re-entrant lines , 1993, Queueing Syst. Theory Appl..

[44]  Scott J. Mason,et al.  Scheduling complex job shops using disjunctive graphs: A cycle elimination procedure , 2003 .

[45]  Michael E. Kuhl,et al.  A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication , 2008 .

[46]  Giovanni Miragliotta,et al.  Decentralised, multi-objective driven scheduling for reentrant shops: A conceptual development and a test case , 2005, Eur. J. Oper. Res..

[47]  Maw-Sheng Chern,et al.  Multi-family scheduling in a two-machine reentrant flow shop with setups , 2008, Eur. J. Oper. Res..

[48]  Hong Chen,et al.  Diffusion approximations for re-entrant lines with a first-buffer-first-served priority discipline , 1996, Queueing Syst. Theory Appl..

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

[50]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[51]  Chi-Hyuck Jun,et al.  Performance analysis of re-entrant flow shop with single-job and batch machines using mean value analysis , 2000 .

[52]  R. Cigolini.  Implementing new dispatching rules at SGS-Thomson Microelectronics , 1999 .

[53]  Sooyoung Kim,et al.  Mean value analysis of re-entrant line with batch machines and multi-class jobs , 2002, Comput. Oper. Res..

[54]  David Stockton,et al.  Control point policy optimization using genetic algorithms , 2008 .

[55]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[56]  Cheng-Hsiang Liu,et al.  A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop , 2010 .

[57]  Felix T.S. Chan,et al.  Comparative performance analysis of a flexible manufacturing system (FMS): a review-period-based control , 2008 .

[58]  Tae-Eog Lee,et al.  Scheduling single-armed cluster tools with reentrant wafer flows , 2006, IEEE Transactions on Semiconductor Manufacturing.

[59]  Mohamed Khaled Omar,et al.  Stochastic re-entrant line modeling for an environment stress testing in a semiconductor assembly industry , 2006, Appl. Math. Comput..

[60]  J. U. Sun,et al.  PRODUCTION SEQUENCING PROBLEM WITH RE-ENTRANT WORK FLOWS AND SEQUENCE DEPENDENT SETUP TIMES , 1998 .

[61]  Jen-Shiang Chen,et al.  Mixed binary integer programming formulations for the reentrant job shop scheduling problem , 2005, Comput. Oper. Res..

[62]  Jin Young Choi,et al.  Simulation-based two-phase genetic algorithm for the capacitated re-entrant line scheduling problem , 2009, Comput. Ind. Eng..

[63]  S.C.H. Lu,et al.  Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants , 1994 .

[64]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[65]  M. Frank Norman,et al.  Diffusion Approximation of Non-Markovian Processes , 1975 .

[66]  Dieter Armbruster,et al.  Controlling a re-entrant manufacturing line via the push-pull point , 2008 .

[67]  James P. Ignizio.  Cycle time reduction via machine-to-operation qualification , 2009 .

[68]  Giacomo Maria Galante,et al.  Integrated approach to part scheduling and inspection policies for a job shop manufacturing system , 2007 .

[69]  Sushil Kumar,et al.  Efficient real coded genetic algorithm to solve the non-convex hydrothermal scheduling problem , 2007 .

[70]  Gideon Weiss,et al.  Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy , 2006, Queueing Syst. Theory Appl..

[71]  C. Zhou,et al.  The QNET Method for Re-Entrant Queueing Networks with Priority Disciplines , 1997, Oper. Res..

[72]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[73]  James F. Cox,et al.  An exploratory study of protective inventory in a re-entrant line with protective capacity , 2010 .