Hybrid Ant Colony Algorithm for Batch Scheduling in Semiconductor Furnace Operation

被引：0
|
作者：
Jiang X. [1 ]
Zhang P. [2 ]
Lü Y. [1 ]
Zhao X. [2 ]
Zhang J. [1 ]
机构：
[1] School of Mechanical Engineering, Donghua University, Shanghai
[2] School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai
来源：
Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University | 2020年 / 54卷 / 08期
关键词：
Batch scheduling; Furnace; Hybrid ant colony algorithm; Semiconductor manufacture;
D O I：
10.16183/j.cnki.jsjtu.2018.232
中图分类号：
学科分类号：
摘要：
Furnace district is one of the main bottlenecks in semiconductor fabrication, which has a great influence on the entire production line. The current scheduling research in the furnace district mainly focuses on dispatching rules, and the constraints considered are relatively simple. The previous research ignores not only the multi-machine scheduling which contains front and rear procedures but also the re-entrant characteristic of the wafer fabrication. This paper focuses on the scheduling problem of β1→β2 type for minimizing the meaning flow time (MFT) in furnace district. The constraints consist of limited waiting time, incompatible families, and re-entrant flow. It builds a novel β1→β2 model about the scheduling problem, and decomposes the problem into three stages: batch forming, machine selecting, and batch sorting. An algorithm based on the hybrid ant colony optimization algorithm is proposed, which batches the jobs by using a variable threshold control strategy, and sorts these batches by a hybrid ant colony optimization algorithm. According to the results of 54 sets of different scales based on historical production data, it is concluded that the performance of the hybrid ant colony optimization (ACO) algorithm is better than several common heuristic rules and the genetic algorithm. The proposed hybrid-ACO algorithm is applied to the actual wafer production line, which can effectively reduce the water flow time in the production process. © 2020, Shanghai Jiao Tong University Press. All right reserved.
引用
收藏
页码：792 / 804
页数：12
相关论文
共 18 条
  • [1] WU Qidi, QIAO Fei, LI Li, Et al., Scheduling of semiconductor manufacturing system, (2006)
  • [2] IKURA Y, GIMPLE M., Efficient scheduling algorithms for a single batch processing machine, Operations Research Letters, 5, 2, pp. 61-65, (1986)
  • [3] PARSA N R, KARIMI B, HUSSEINI S M., Exact and heuristic algorithms for the just-in-time sche-duling problem in a batch processing system, Computers and Operations Research, 80, pp. 173-183, (2017)
  • [4] CHENG B, WANG Q, YANG S, Et al., An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes, Applied Soft Computing, 13, 2, pp. 765-772, (2013)
  • [5] PARSA N, KARIMI B, HUSSEINI S., Minimizing total flow time on a batch processing machine using a hybrid max-min ant system, Computers and Industrial Engineering, 99, pp. 372-381, (2016)
  • [6] GURNANI H, ANUPINDI R, AKELLA R., Control of Batch Processing Systems in Semiconductor Wafer Fabrication Facilities, IEEE Transactions on Semiconductor Manufacturing, 5, 4, pp. 319-328, (1992)
  • [7] CEREKCI A, BANERJEE A., Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance, International Journal of Production Research, 48, 5, pp. 1339-1359, (2010)
  • [8] HAM M, LEE Y H, AN J., IP-Based real-time dispatching for two-machine batching problem with time window constraints, IEEE Transactions on Automations Science and Engineering, 8, 3, pp. 589-597, (2011)
  • [9] AHMADI J H, AHMADI R, DASU S, Et al., Bat-ching and Scheduling Jobs on batch and discrete processors, Operations Research, 40, 4, pp. 750-763, (1992)
  • [10] LI Cheng, JIANG Zhibin, LI You, Et al., Rule-based scheduling of batch processing machine applied to semiconductor wafer fabrication system, Journal of Shanghai Jiao Tong University, 47, 2, pp. 230-235, (2013)
12