Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots. (English) Zbl 1128.90498
Summary: A wet station performs a cleaning process in semiconductor manufacturing. It consists of several processing baths and multiple wafer-handling robots. It simultaneously processes multiple wafer types with different processing sequences. Robot collisions and deadlocks should be prevented. There are also strict no-wait time constraints where, after a wafer is cleaned in a chemical bath, it should immediately be removed from the bath and rinsed at a water bath. We examine the scheduling problem when different jobs are repetitively processed in cyclic order. We propose a way of modelling a Petri net for the wet station operation. By examining the Petri net model, we develop conditions for preventing deadlocks and collisions. We show that the Petri net model, which is apparently an asymmetric Petri net, is behaviourally equivalent to an event graph, for which cycle time computation and many analysis methods are available. Based on these findings, we develop a mixed integer programming model for determining the robot task sequences, the jobs in progress at the baths, and a timing schedule, which are free from deadlocks and collisions, satisfy the no-wait time constraints, and minimize the cycle time. We discuss the computational results.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
References:
| [1] | Baccelli FL, Synchronization and Linearity: An Algebra for Discrete Event Systems (1992) · Zbl 0824.93003 |
| [2] | Barkaoui K, Lect. Notes Comput. Sci. 1091 pp 57– (1996) · doi:10.1007/3-540-61363-3_4 |
| [3] | DOI: 10.1109/70.988976 · doi:10.1109/70.988976 |
| [4] | DOI: 10.1109/70.660860 · doi:10.1109/70.660860 |
| [5] | DOI: 10.1023/A:1018995317468 · Zbl 0997.90032 · doi:10.1023/A:1018995317468 |
| [6] | DOI: 10.1109/9.880643 · Zbl 1169.93373 · doi:10.1109/9.880643 |
| [7] | Gurov DB, Proceedings of the IEEE International Conference Systems pp 4137– (1995) |
| [8] | DOI: 10.1002/jos.92 · Zbl 0995.90032 · doi:10.1002/jos.92 |
| [9] | Kim JH, IEEE Trans. Semicond. Mfg 6 pp 521– (2003) · doi:10.1109/TSM.2003.815203 |
| [10] | Lee HY, IEEE Trans. Semicond. Mfg (2006) |
| [11] | DOI: 10.1023/A:1008123115577 · doi:10.1023/A:1008123115577 |
| [12] | DOI: 10.1109/TASE.2005.851236 · doi:10.1109/TASE.2005.851236 |
| [13] | Lee, T-E and Park, S-H. Steady state analysis of a timed event graph with time window constraints. Proceedings of the IEEE International Conference on Automation Science and Engineering (CASE). pp.1–6. |
| [14] | DOI: 10.1287/opre.45.1.72 · Zbl 0892.90102 · doi:10.1287/opre.45.1.72 |
| [15] | DOI: 10.1080/07408179408966593 · doi:10.1080/07408179408966593 |
| [16] | DOI: 10.1287/opre.1040.0144 · Zbl 1165.90460 · doi:10.1287/opre.1040.0144 |
| [17] | DOI: 10.1016/S0005-1098(98)00048-X · Zbl 0966.90028 · doi:10.1016/S0005-1098(98)00048-X |
| [18] | Liu J, IIE Trans. 34 pp 905– (2002) |
| [19] | DOI: 10.1016/S0003-2670(99)00818-1 · doi:10.1016/S0003-2670(99)00818-1 |
| [20] | DOI: 10.1080/095372800232216 · doi:10.1080/095372800232216 |
| [21] | DOI: 10.1109/CDC.2002.1184602 · doi:10.1109/CDC.2002.1184602 |
| [22] | DOI: 10.1109/5.24143 · doi:10.1109/5.24143 |
| [23] | Ng WC, Int. J. flex. Mfg Syst. 8 pp 44– (1996) |
| [24] | DOI: 10.1080/05695557608975070 · doi:10.1080/05695557608975070 |
| [25] | Proth, J-M. Petri nets for modeling and evaluating deterministic and stochastic manufacturing systems. Proceedings of the Seventh International Workshop on Petri Nets and Performance Models. pp.2–14. |
| [26] | DOI: 10.1109/70.964662 · doi:10.1109/70.964662 |
| [27] | DOI: 10.1023/A:1020911406530 · doi:10.1023/A:1020911406530 |
| [28] | DOI: 10.1080/07408178808966165 · doi:10.1080/07408178808966165 |
| [29] | DOI: 10.1109/TSM.2003.822730 · doi:10.1109/TSM.2003.822730 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
