Heuristic tabu search scheduling algorithm for wet-etching systems in semiconductor wafer fabrications  

作　　者：周炳海 Li Xin 

机构地区：[1]School of Mechanical Engineering,Tongji University [2]Department of Systems Engineering and Engineering Management,City University of Hong Kong

出　　处：《High Technology Letters》2013年第2期111-116,共6页高技术通讯（英文版）

基　　金：Supported by the National Natural Science Foundation of China(No.71071115,61273035)

摘　　要：To improve overall equipment efficiency(OEE) of a semiconductor wafer wet-etching system,a heuristic tabu search scheduling algorithm is proposed for the wet-etching process in the paper,with material handling robot capacity and wafer processing time constraints of the process modules considered.Firstly,scheduling problem domains of the wet-etching system(WES) are assumed and defined,and a non-linear programming model is built to maximize the throughput with no defective wafers.On the basis of the model,a scheduling algorithm based on tabu search is presented in this paper.An improved Nawaz,Enscore,and Ham(NEH) heuristic algorithm is used as the initial feasible solution of the proposed heuristic algorithm.Finally,performances of the proposed algorithm are analyzed and evaluated by simulation experiments.The results indicate that the proposed algorithm is valid and practical to generate satisfied scheduling solutions.To improve overall equipment efficiency （OEE） of a semiconductor wafer wet-etching system, a heuristic tabu search scheduling algorithm is proposed for the wet-etching process in the paper, with material handling robot capacity and wafer processing time constraints of the process modules considered. Firstly, scheduling problem domains of the wet-etching system （WES） are assumed and defined, and a non-linear programming model is built to maximize the throughput with no defective wafers. On the basis of the model, a scheduling algorithm based on tabu search is presented in this paper. An improved Nawaz, Enscore, and Ham （NEH） heuristic algorithm is used as the initial feasible solution of the proposed heuristic algorithm. Finally, performances of the proposed algorithm are analyzed and evaluated by simulation experiments. The results indicate that the proposed algo- rithm is valid and practical to generate satisfied scheduling solutions.

关 键 词：wet-etching systems （ WES ） semiconductor wafer fabrications tabu search scheduling problems residency constraints 

分 类 号：TN305[电子电信—物理电子学]