Multi-Objective Reentrant Hybrid Flowshop Scheduling with Machines Turning on and off Control Strategy Using Improved Multi-Verse Optimizer Algorithm

被引:24
作者
Geng, Kaifeng [1 ,2 ]
Ye, Chunming [1 ]
Cao, Lei [1 ]
Liu, Li [2 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Business, Shanghai 200093, Peoples R China
[2] Nanyang Inst Technol, Informat Construct & Management Ctr, Nanyang 473004, Henan, Peoples R China
基金
中国国家自然科学基金;
关键词
TOTAL-ENERGY CONSUMPTION; MINIMIZING MAKESPAN; GENETIC ALGORITHM; JOB-SHOP; OBJECTIVES;
D O I
10.1155/2019/2573873
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper focuses on the multi-objective optimization of the reentrant hybrid flowshop scheduling problem (RHFSP) with machines turning on and off control strategy. RHFSP exhibits significance in many industrial applications, but scheduling with both energy consumption consideration and reentrant concept is relatively unexplored at present. In this study, an improved Multi-Objective Multi-Verse Optimizer (IMOMVO) algorithm is proposed to optimize the RHFSP with objectives of makespan, maximum tardiness, and idle energy consumption. To solve the proposed model more effectively, a series of improved operations are carried out, including population initialization based on Latin hypercube sampling (LHS), individual position updating based on Levy flight, and chaotic local search based on logical self-mapping. In addition, a right-shift procedure is used to adjust the start time of operations aiming to minimize the idle energy consumption without changing the makespan. Then, Taguchi method is utilized to study the influence of different parameter settings on the scheduling results of the IMOMVO algorithm. Finally, the performance of the proposed IMOMVO algorithm is evaluated by comparing it with MOMVO, MOPSO, MOALO, and NSGA-II on the same benchmark set. The results show that IMOMVO algorithm can solve the RHFSP with machines turning on and off control strategy effectively, and in terms of convergence and diversity of non-dominated solutions, IMOMVO is obviously superior to other algorithms. However, the distribution level of the five algorithms has little difference. Meanwhile, by turning on and off the machine properly, the useless energy consumption in the production process can be reduced effectively.
引用
收藏
页数:18
相关论文
共 39 条
[1]  
[Anonymous], 2002, THESIS MIT
[2]  
Bertel S, 2004, EUR J OPER RES, V159, P651, DOI [10.1016/S0377-2217(03)00434-X, 10.1016/s0377-2217(03)00434-x]
[3]   Minimizing makespan in reentrant flow-shops using hybrid tabu search [J].
Chen, Jen-Shiang ;
Pan, Jason Chao-Hsien ;
Wu, Chien-Kuang .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 34 (3-4) :353-361
[4]   Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm [J].
Cho, Hang-Min ;
Bae, Suk-Joo ;
Kim, Jungwuk ;
Jeong, In-Jae .
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (03) :529-541
[5]   Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line [J].
Choi, Hyun-Seon ;
Kim, Ji-Su ;
Lee, Dong-Ho .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) :3514-3521
[6]   Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates [J].
Choi, Hyun-Seon ;
Kim, Hyung-Won ;
Lee, Dong-Ho ;
Yoon, Junggee ;
Yun, Chang Yeon ;
Chae, Kevin B. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 42 (9-10) :963-973
[7]   Minimizing makespan on an m-machine re-entrant flowshop [J].
Choi, Seong-Woo ;
Kim, Yeong-Dae .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) :1684-1696
[8]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[9]   Modelling and Simulation of Re-Entrant Flow Shop Scheduling: An Application in Semiconductor Manufacturing [J].
El-Khouly, Ingy A. ;
El-Kilany, Khaled S. ;
El-Sayed, Aziz E. .
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, :211-216
[10]  
Graves S.C., 1983, Journal of Operations Management, V3, P197, DOI DOI 10.1016/0272-6963(83)90004-9