An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption

被引:38
作者
Yuksel, Damla [1 ]
Tasgetiren, M. Fatih [2 ]
Kandiller, Levent [1 ]
Gao, Liang [3 ]
机构
[1] Yasar Univ, Dept Ind Engn, TR-35100 Izmir, Turkey
[2] Yasar Univ, Dept Int Logist Management, TR-35100 Izmir, Turkey
[3] Huazhong Univ Sci & Technol, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China
关键词
No-wait permutation flowshop scheduling problem; Energy-efficient scheduling; Bi-objective optimization; Metaheuristics; SWARM OPTIMIZATION ALGORITHM; ITERATED GREEDY ALGORITHM; BEE COLONY ALGORITHM; POWER-CONSUMPTION; M-MACHINE; MAKESPAN; HEURISTICS; PARALLEL; SHOPS; TIME;
D O I
10.1016/j.cie.2020.106431
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In manufacturing scheduling, sustainability concerns that raise from the service-oriented performance criteria have seldom been studied in the literature. This study aims to fill this gap in the literature by integrating the different energy consumption levels at the operational level. Since energy-efficient scheduling ideas have recently been increasing its popularity in industry due to the need for sustainable production, this study will be a good resource for future energy-efficient scheduling problems. Energy consumption in high volume manufacturing is a significant cost item in most industries. Potential energy saving mechanisms are needed to be integrated into manufacturing facilities for cost minimization at the operational level. A leading energy-saving mechanism in manufacturing is to be able to adapt/change the machine speed levels which exactly determines the energy consumption of the machines. Hence, in this study, the afore-mentioned framework is applied to the no-wait permutation flowshop scheduling problem (NWPFSP) which is a variant of classical permutation flowshop scheduling problems. However, it has various critical applications in industries such as chemical, pharmaceutical, food-processing, etc. This study proposes both mixed-integer linear programming (MILP) and constraint programming (CP) model formulations for the energy-efficient bi-objective no-wait permutation flowshop scheduling problems (NWPFSPs) considering the total tardiness and the total energy consumption minimization simultaneously. This problem treats total energy consumption as a second objective. Thus, the trade-off between the total tardiness - a service level measurement indicator - and the total energy consumption - a sustainability level indicator - is analyzed in this study. Furthermore, due to the NP-hardness nature of the first objective of the problem, a novel multi-objective discrete artificial bee colony algorithm (MO-DABC), a traditional multi-objective genetic algorithm (MO-GA) and a variant of multi-objective genetic algorithm with a local search (MO-GALS) are proposed for the bi-objective no-wait permutation flowshop scheduling problem. Besides the proposed algorithms are compared with the multi-objective energy-efficient algorithms from the literature. Consequently, a comprehensive comparative metaheuristic analysis is carried out. The computational results indicate that the proposed MO-DABC algorithm outperforms MILP, CP, MO-GA, MO-GALS, and algorithms from the literature in terms of both cardinality and quality of the solutions. The powerful results of this study show that the proposed models and algorithms can be adapted to other energy-efficient scheduling problems such as no-idle flowshop, blocking flowshop and job-shop scheduling problems or to other higher-level integrated manufacturing problems.
引用
收藏
页数:19
相关论文
共 74 条
[31]   A new design method based on artificial bee colony algorithm for digital IIR filters [J].
Karaboga, Nurhan .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2009, 346 (04) :328-348
[32]  
Karabulut K, 2012, IEEE C EVOL COMPUTAT
[33]  
LI JQ, 2008, ICNC 2008 4 INT C, P516, DOI DOI 10.1243/09544054JEM989
[34]   Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics [J].
Lin, Shih-Wei ;
Ying, Kuo-Ching .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2016, 64 :115-125
[35]  
Lourenço HR, 2003, INT SER OPER RES MAN, V57, P321
[36]   Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm [J].
Lu, Chao ;
Gao, Liang ;
Li, Xinyu ;
Pan, Quanke ;
Wang, Qi .
JOURNAL OF CLEANER PRODUCTION, 2017, 144 :228-238
[37]   ON THE JOB-SHOP SCHEDULING PROBLEM [J].
MANNE, AS .
OPERATIONS RESEARCH, 1960, 8 (02) :219-223
[38]   Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem [J].
Mansouri, S. Afshin ;
Aktas, Emel .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2016, 67 (11) :1382-1394
[39]   Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption [J].
Mansouri, S. Afshin ;
Aktas, Emel ;
Besikci, Umut .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 248 (03) :772-788
[40]   Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems [J].
Mavrotas, George .
APPLIED MATHEMATICS AND COMPUTATION, 2009, 213 (02) :455-465