On-line scheduling of robotic cells with post-processing residency constraints

This paper considers the problem of on-line scheduling of robotic cells with post-processing residency constraints. We model this scheduling problem with temporal constraints using Dechter, Meiri, and Pearl's formalism. Then, we present an on-line scheduling algorithm with polynomial computational complexity. The on-line scheduling algorithm consists of FEASIBLE/spl I.bar/SCHED/spl I.bar/SPACE and OPTIMAL/spl I.bar/SCHED. The former finds feasible solution space for a newly inserted part, which guarantees both logical and temporal correctness. The latter computes the optimal solution in the feasible solution space obtained previously. The objective of the scheduling is to minimize the completion time of the last operation of the part. We prove that each procedure has polynomial complexity.

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

[2]  Peter van Zant.  Microchip fabrication : a practical guide to semiconductor processing , 2004 .

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

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

[5]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

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

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

[9]  Nimal Nissanke.  Realtime systems , 1997, Prentice Hall series in computer science.

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

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

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

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

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

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