A case study on the multistage IC final testing scheduling problem with reentry

The integrated-circuit final testing scheduling problem (ICFTSP) with reentry is a variation of the complex flow-shop scheduling problem, which is also a generalization of the classical reentrant flow batch process problem, and the identical parallel machine problem. In this paper, we present a case study on the ICFTSP with reentry, which is taken from a final testing shop floor in an integrated circuit manufacturing factory. For the case investigated, the jobs are clustered by their product types, which must be processed on groups of parallel machines at various process stages following the manufacturing sequence, which must be completed before the due dates. The job processing time depends on the product type, and the machine setup time is sequentially dependent on the orders of jobs processed. The objective is to schedule jobs without violating all constraints, while the total machine workload is minimized. Since the ICFTSP has reentry characteristic, and involves job processing precedence, serial-processing stage, batch-processing stage, job clusters, job-cluster dependent processing time, due dates, machine capacity, and sequence dependent setup time, it is more difficult to solve than the classical flow-shop scheduling problem. We present three fast network algorithms to efficiently solve the ICFTSP with reentry and provide a performance comparison between the three algorithms on eight test problems. r 2003 Elsevier B.V. All rights reserved.

[1]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

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

[4]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[5]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[6]  Tsu-Shuan Chang,et al.  Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation , 1995, IEEE Trans. Syst. Man Cybern..

[7]  David D. Yao,et al.  A queueing network model for semiconductor manufacturing , 1996 .

[8]  Johannes M.J. Schutten,et al.  Parallel machine scheduling with release dates, due dates and family setup times , 1996 .

[9]  Reha Uzsoy,et al.  Decomposition methods for scheduling semiconductor testing facilities , 1996 .

[10]  F.D. Vargas-Villamil,et al.  Scheduling of reentrant manufacturing lines using a model predictive control (MPC) approach , 1997, Proceedings of the 1997 American Control Conference (Cat. No.97CH36041).

[11]  Grisselle Centeno,et al.  Parallel machine scheduling with release time and machine eligibility restrictions , 1997 .

[12]  Koji Nakamae,et al.  Effect of express lots on production dispatching rule scheduling and cost in final test process of LSI manufacturing system , 1997, 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings (Cat. No.97CH36023).

[13]  Louis A. Martin-Vega,et al.  A DECOMPOSITION METHODOLOGY FOR SCHEDULING SEMICONDUCTOR TEST OPERATIONS FOR NUMBER OF TARDY JOB MEASURES , 1997 .

[14]  Hark Hwang,et al.  Production sequencing problem with reentrant work flows and sequence dependent setup times , 1997 .

[15]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[16]  Chengbin Chu,et al.  Parallel machine scheduling to minimize total tardiness , 2002 .

[17]  Shu-Hsing Chung,et al.  The wafer probing scheduling problem (WPSP) , 2002, J. Oper. Res. Soc..