Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability

A methodology for rescheduling a semiconductor fabrication line in the presence of predicted and unpredicted machine unreliability and job demand is presented. The proposed methodology consists of four major steps. (1) Representation of the fabrication line: the fabrication line is represented using a Neuro-Expert Petri net (NEPN) model. The entire fabrication line is decomposed into a ‘two machine and one buffer’ subsystem and represented using the NEPN model. (2) Estimation of failure and repair rates: the probabilistic machine failure and repair rates are determined using the method proposed by Jeong and Kim (1998). (3) Activation of the rescheduling algorithm: the rescheduling algorithm is activated after the planned mean time to reschedule the fabrication line ( ). is calculated by taking into account the estimated machine failure and repair rates, and the threshold queue limits of the waiting jobs. The rescheduling algorithm is also activated in cases of unpredictable machine breakdown or repair, and where the job queue length exceeds a certain threshold. (4) Execution of the rescheduling algorithm: the rescheduling algorithm determines whether or not to reschedule a job onto another machine by taking into account factors such as due dates and profits generated by the jobs. The proposed solution methodology is explained using an illustrative example. The computational results developed for the makespan criteria reveal that the proposed methodology is reliable and performs relatively well.

[1]  Pravin K. Johri,et al.  Practical issues in scheduling and dispatching in semiconductor wafer fabrication , 1993 .

[2]  MuDer Jeng,et al.  Markovian timed Petri nets for performance analysis of semiconductor manufacturing systems , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Salvatore Cavalieri,et al.  Improving flexible semiconductor manufacturing system performance by a coloured Petri net-based scheduling algorithm , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.

[4]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[6]  Stéphane Dauzère-Pérès,et al.  A modified shifting bottleneck procedure for job-shop scheduling , 1993 .

[7]  Hong Chen,et al.  Empirical Evaluation of a Queueing Network Model for Semiconductor Wafer Fabrication , 1988, Oper. Res..

[8]  Yueh-Min Huang,et al.  Scheduling multiprocessor job with resource and timing constraints using neural networks , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Doo Yong Lee,et al.  Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing , 1998, J. Intell. Manuf..

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

[11]  Carlos F. G. Bispo,et al.  Adaptive scheduling for high-volume shops , 1992, IEEE Trans. Robotics Autom..

[12]  Yeong-Dae Kim,et al.  Performance analysis of assembly/disassembly systems with unreliable machines and random processing times , 1998 .

[13]  Li-Chen Fu,et al.  Modelling, control and simulation of an IC wafer fabrication system: A generalized stochastic coloured timed Petri Net approach , 2000 .

[14]  M. Chen,et al.  Applications of neural networks to solving SMT scheduling problems a case study , 1999 .

[15]  Chun-Hung Chen,et al.  Dynamic scheduling rule selection for semiconductor wafer fabrication , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[16]  C. S. Sung,et al.  A Neural Network Approach for Batching Decisions in Wafer Fabrication , 1999 .

[17]  Jeffrey W. Herrmann,et al.  Predicting the performance of rescheduling strategies for parallel machine systems , 2000 .

[18]  Reha Uzsoy,et al.  A review of production planning and scheduling models in the semiconductor industry , 1994 .

[19]  Shi-Chung Chang.  Demand-driven, iterative capacity allocation and cycle time estimation for re-entrant lines , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[20]  Kimon P. Valavanis.  On the hierarchical modeling analysis and simulation of flexible manufacturing systems with extended Petri nets , 1990, IEEE Trans. Syst. Man Cybern..

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

[22]  Li-Chen Fu,et al.  An effective search strategy for wafer fabrication scheduling with uncertain process requirements , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[23]  Yadati Narahari,et al.  A Petri net approach to the modelling and analysis of flexible manufacturing systems , 1985 .

[24]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[25]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[26]  Reha Uzsoy,et al.  Performance of decomposition procedures for job shop scheduling problems with bottleneck machines , 2000 .

[27]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..