Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots
Authors:
- 22 February 2007
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 45 (3) , 487-507
Abstract
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.Keywords
This publication has 23 references indexed in Scilit:
- An Extended Event Graph With Negative Places and Tokens for Time Window ConstraintsIEEE Transactions on Automation Science and Engineering, 2005
- Deadlock-Free Scheduling of Photolithography Equipment in Semiconductor FabricationIEEE Transactions on Semiconductor Manufacturing, 2004
- Scheduling analysis of time-constrained dual-armed cluster toolsIEEE Transactions on Semiconductor Manufacturing, 2003
- Multicyclic hoist scheduling with constant processing timesIEEE Transactions on Robotics and Automation, 2002
- Cyclic scheduling in a robotic production lineJournal of Scheduling, 2002
- Evaluation of cleaning efficiency with a radioactive tracer and development of a microwave digestion method for semiconductor processesAnalytica Chimica Acta, 2000
- Cyclic scheduling of a hoist with time window constraintsIEEE Transactions on Robotics and Automation, 1998
- DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINEIIE Transactions, 1994
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- Hoist Scheduling For A PCB Electroplating FacilityIIE Transactions, 1988