Multi-objective reentrant scheduling problem for semiconductor workshop

被引:0
作者
Zhu G. [1 ]
Jia H. [1 ]
机构
[1] School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou
来源
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | 2023年 / 51卷 / 02期
关键词
multi-objective; optimal foraging algorithm; reentrant hybrid flow shop; semiconductor; substantial uncertainty factor;
D O I
10.13245/j.hust.230213
中图分类号
学科分类号
摘要
In semiconductor manufacturing workshop,the machine states are often inconsistent when the products re-enter the machine. The traditional reentrant scheduling methods are unsuitable for semiconductor workshop scheduling because of the characteristic of inconsistent.According to the characteristics of semiconductor workshop,the multi-objective reentrant hybrid flow shop scheduling problem for the semiconductor manufacturing workshop was proposed.A mathematical model of this problem was built based on minimizing the maximum completion time,reducing product failure rate and decreasing machine process switching times.An optimal foraging algorithm based on substantial uncertainty factor (SUF_OFA) was proposed.In proposed algorithm,the grey correlation analyzing and the Pythagorean fuzzy set of MYCIN uncertainty factor were used to build the multi-objective processing strategy.The substantial uncertainty factors of Pareto solutions were adopted as the fitness value of the optimal foraging algorithm.The workpiece number was used as the coding scheme,and the feasible scheduling solution was decoded by the three-stage decoding method.Through different experiments and a semiconductor workshop case,the proposed algorithm was compared with four other algorithms.The proposed model was verified and the performance of the proposed algorithm was analyzed.The results show that SUF_OFA has significant advantages in solving the multi-objective reentrant hybrid flow shop scheduling problem. © 2023 Huazhong University of Science and Technology. All rights reserved.
引用
收藏
页码:122 / 130
页数:8
相关论文
共 22 条
  • [1] LEE Y H, LEE B., Push-pull production planning of the re-entrant process[J], International Journal of Advanced Manufacturing Technology, 22, 11, pp. 922-931, (2003)
  • [2] WANG M Y, SETHI S P, VANDEVELDE S L., Minimizing makespan in a class of reentrant shops[J], Operations Research, 45, 5, pp. 702-712, (1997)
  • [3] CIAVOTTA M,, MINELLA G,, RUIZ R., Multi-objective sequence dependent setup times permutation flowshop: a new algorithm and a comprehensive study[J], European Journal of Operational Research, 227, 2, pp. 301-313, (2013)
  • [4] XU J Y, YIN Y Q, CHENG T C E, A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan[J], Applied Soft Computing, 24, pp. 277-283, (2014)
  • [5] DONG J, CHUNMING Y E., Research on collaborative optimization of green manufacturing in semiconductor wafer distributed heterogeneous factory[J], Applied Sciences, 9, 14, (2019)
  • [6] CHAMNANLOR C, Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints[J], Journal of Intelligent Manufacturing, 28, 8, pp. 1915-1931, (2017)
  • [7] LIN C C, LIU W Y, CHEN Y H., Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity[J], Computers & Industrial Engineering, 139, (2020)
  • [8] HUANG R H,, YU S C,, KUO C W., Reentrant two-stage multiprocessor flow shop scheduling with due windows[J], International Journal of Advanced Manufacturing Technology, 71, 5, pp. 1263-1276, (2014)
  • [9] YING K C, LIN S W, WAN S Y., Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm[J], International Journal of Production Research, 52, 19, pp. 5735-5747, (2014)
  • [10] 30, 4, pp. 217-223