To improve the productivity of cluster tools in semiconductor fabrications, on the basis of stating scheduling problems, a try and error-based scheduling algorithm was proposed with residency time constraints and an objective of minimizing Makespan for the wafer jobs in cluster tools. Firstly, mathematical formulations of scheduling problems were presented by using assumptions and definitions of a scheduling domain. Resource conflicts were analyzed in the built scheduling model, and policies to solve resource conflicts were built. A scheduling algorithm was developed. Finally, the performances of the proposed algorithm were evaluated and compared with those of other methods by simulations. Experiment results indicate that the proposed algorithm is effective and practical in solving the scheduling problem of the cluster tools. Copyright © 2012 Central South University Press and Springer-Verlag Berlin Heidelberg.
|Journal||Journal of Central South University|
|Publication status||Published - Jan 2012|
CitationZhou, B.-H., & Li, X. (2012). Try and error-based scheduling algorithm for cluster tools of wafer fabrications with residency time constraints. Journal of Central South University, 19, 187-192. doi: 10.1007/s11771-012-0990-9
- Cluster tools
- Residency constraints
- Scheduling model
- Simulation experiments