ZHANG Long, LIU Min, HAO Jinghua, et al., “Scheduling Semiconductor Wafer Fabrication Using a New Harmony Search Algorithm Based on Receipt Priority Interval,” Chinese Journal of Electronics, vol. 25, no. 5, pp. 866-872, 2016, doi: 10.1049/cje.2016.08.043
Citation: ZHANG Long, LIU Min, HAO Jinghua, et al., “Scheduling Semiconductor Wafer Fabrication Using a New Harmony Search Algorithm Based on Receipt Priority Interval,” Chinese Journal of Electronics, vol. 25, no. 5, pp. 866-872, 2016, doi: 10.1049/cje.2016.08.043

Scheduling Semiconductor Wafer Fabrication Using a New Harmony Search Algorithm Based on Receipt Priority Interval

doi: 10.1049/cje.2016.08.043
Funds:  This work is supported by the National Key Basic Research and Development Program of China (No.2009CB320602), the National Natural Science Foundation of China (No.61025018, No.61021063, No.61104172), and the National Science and Technology Major Project of China (No.2011ZX02504-008).
More Information
  • Corresponding author: LIU Min (corresponding author) was born in 1965. He received the Ph.D. degree from Tsinghua University, Beijing, China. He is currently a professor with the Department of Automation, Tsinghua University, the deputy director of the Division of Automation with the Tsinghua National Laboratory for Information Science and Technology, Beijing, and the director of the Research Center for Control and Optimization of Complex Industrial Process, Tsinghua University. He led over 20 important research projects, including the National 973 Program of China, the National Science and Technology Major Project of China, the National Science Fund for Distinguished Young Scholars of China, and the National 863 High-Tech Program of China. He has authored over 100 papers and a monograph supported by the National Defense Science and Technology Book Publishing Fund. His current research interests include intelligent scheduling and intelligent operational optimization of complex manufacturing systems. (Email:lium@mail.tsinghua.edu.cn)
  • Received Date: 2014-08-07
  • Rev Recd Date: 2014-12-01
  • Publish Date: 2016-09-10
  • For the scheduling problem of Semiconductor wafer fabrication (SWF), a new Dispatching rule based on the load balance (DRLB) is proposed. Further, a new Harmony search (HS) algorithm based receipt priority interval (HS_rpi) is presented to minimize the mean cycle time. A kind of chaotic sequence is used as the harmony vector. Then, a conversion method is designed to convert the real number harmony vector to the mixed vector representing the priorities of all receipts and the algorithm parameters. In order to increase the algorithm robustness and decrease the scale of the scheduling problem, based on receipt priority interval and DRLB, we give a special conversion method used to convert the above mixed vector to the solution of the scheduling problem of SWF. Computational simulations based on the practical instances validate the proposed algorithm.
  • loading
  • Thomas W. Sloan, "Shop-floor scheduling of semiconductor wafer fabs:Exploring the influence of technology, market, and performance objectives", IEEE Transactions on Semiconductor Manufacturing, Vol.16, No.2, pp.281-289, 2003.
    Appa Iyer Sivakumar and Amit Kumar Gupta, "Online multiobjective Pareto optimal dynamic scheduling of semiconductor back-end using conjunctive simulated scheduling", IEEE Transactions on Electronics Packaging Manufacturing, Vol.29, No.2, pp.99-109, 2006.
    Chengtao Guo, Zhibin Jiang, Huai Zhang, et al., "Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system", Computers & Industrial Engineering, Vol.62, No.1, pp.141-151, 2012
    Tsung-Che Chiang, "Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms:Review and opportunity", Computers & Industrial Engineering, Vol.64, No.1, pp.524-535, 2013.
    M.L. Pinedo, Scheduling:Theory, Algorithms, and Systems, New Jersey, Prentice-Hall, 2000.
    C.S. Mazumdar, M. Mathirajan, R. Gopinath, et al., "Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints", International Journal of Operational Research, Vol.3, No.1-2, pp.119-139, 2008.
    Amir Noroozi, Hadi Mokhtari and Isa Nakhai Kamal Abadi, "Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines", Neurocomputing, Vol.101, pp.190-203, 2013.
    F.D. Chou, H.M. Wang and P.C. Chang, "A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem", Expert Systems with Applications, Vol.35, No.4, pp.1889-1898, 2008.
    Rene Drießel and Lars Moench, "Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search", International Conference on Computers & Industrial Engineering, CIE 2009, pp.273-278, 2009.
    C.F. Chien and C.H. Chen, "A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups", OR Spectrum, Vol.29, No.3, pp.391-419, 2007.
    Min Liu, Jinghua Hao and Cheng Wu, "A new genetic algorithm for parallel machine scheduling problems with procedure constraints and its applications", Chinese Journal of Electronics, Vol.15, No.3, pp.463-466, 2006.
    Yang Song, Mike Tao Zhang, Jingang Yi, et al., "Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization", IEEE Transactions on Automation Science and Engineering, Vol.4, No.4, pp.569-578, 2007.
    Quanke Pan, Ling Wang and Liang Gao, "A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers", Applied Soft Computing, Vol.11, pp.5270-5280, 2011.
    Z.W. Geem, J.H. Kim and G.V. Loganathan, "A new heuristic optimization algorithm:Harmony search", Simulation, Vol.76, No.2, pp.60-68, 2001.
    M.F. Neuts, "A general class of bulk queues with Poisson input", Management Science, Vol.38, No.3, pp.759-770, 1967.
    R. Caponetto, L. Fortuna, S. Fazzino, et al., "Chaotic sequences to improve the performance of evolutionary algorithms", IEEE Transactions on Evolutionary Computation, Vol.7, No.3, pp.289-304, 2003.
    C.R. Glassey and W.W. Weng, "Dynamic batching heuristic for simultaneous processing", IEEE Transactions on Semiconductor Manufacturing, Vol.4, No.2, pp.77-82, 1991.
  • 加载中


    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (344) PDF downloads(582) Cited by()
    Proportional views


    DownLoad:  Full-Size Img  PowerPoint