Online scheduling of integrated single-wafer processing tools with temporal constraints

This paper addresses the issues of online scheduling for integrated single-wafer processing tools with temporal constraints. The integrated single-wafer processing tool is an integrated processing system consisting of single-wafer processing modules and transfer modules. Certain chemical processes require that the wafer flow satisfies temporal constraints, especially, postprocessing residency constraints. This paper proposes an online scheduling method that guarantees both logical and temporal correctness for the integrated single-wafer processing tools. First, mathematical formulation of the scheduling problem using temporal constraint sets is presented. Then, an online, noncyclic scheduling algorithm with polynomial complexity is developed. The proposed scheduling algorithm consists of two subalgorithms: FEASIBLE/spl I.bar/SCHED/spl I.bar/SPACE and OPTIMAL/spl I.bar/SCHED. The former computes the feasible solution space in the continuous time domain, and the latter computes the optimal solution that minimizes the completion time of the last operation of a newly inserted wafer.

[1]  Alain Hertz,et al.  on a Scheduling Problem in a Robotized Analytical System , 1996, Discret. Appl. Math..

[2]  Chengbin Chu,et al.  Cyclic scheduling of a hoist with time window constraints , 1998, IEEE Trans. Robotics Autom..

[3]  Hyun Joong Yoon,et al.  Deadlock-free scheduling of photolithography equipment in semiconductor fabrication , 2004 .

[4]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[5]  MengChu Zhou,et al.  Deadlock avoidance in semiconductor track systems , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[6]  L. W. Phillips,et al.  Mathematical Programming Solution of a Hoist Scheduling Program , 1976 .

[7]  Ronald D. Armstrong,et al.  A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints , 1994 .

[8]  Henry L. W. Nuttle,et al.  Hoist Scheduling For A PCB Electroplating Facility , 1988 .

[9]  Rina Dechter,et al.  Processing Disjunctions in Temporal Constraint Networks , 1997, Artif. Intell..

[10]  Tae-Eog Lee,et al.  Scheduling analysis of time-constrained dual-armed cluster tools , 2003 .

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

[12]  Eugene Levner,et al.  Multiple-part cyclic hoist scheduling using a sieve method , 1999, IEEE Trans. Robotics Autom..

[13]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[14]  Babak Hamidzadeh,et al.  An optimal periodic scheduler for dual-arm robots in cluster tools with residency constraints , 2001, IEEE Trans. Robotics Autom..

[15]  Babak Hamidzadeh,et al.  Optimal scheduling techniques for cluster tools with process-module and transport-module residency constraints , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[16]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[17]  Jean-Marie Proth,et al.  Scheduling no-wait production with time windows and flexible processing times , 2001, IEEE Trans. Robotics Autom..

[18]  Feng Chu,et al.  Multicyclic hoist scheduling with constant processing times , 2002, IEEE Trans. Robotics Autom..