Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization

被引:33
作者
Soleimani, Hamed [1 ,2 ]
Ghaderi, Hadi [3 ]
Tsai, Pei-Wei [4 ]
Zarbakhshnia, Navid [5 ]
Maleki, Mohsen [6 ]
机构
[1] Univ Melbourne, Sch Math & Stat, Melbourne, Vic, Australia
[2] IAU, Qazvin Branch, Fac Ind & Mech Engn, Qazvin, Iran
[3] Swinburne Univ Technol, Swinburne Business Sch, Dept Business Technol & Entrepreneurship, Hawthorn, Vic 3122, Australia
[4] Swinburne Univ Technol, Sch Software & Elect Engn, Dept Comp Sci & Software Engn, Hawthorn, Vic 3122, Australia
[5] IAU, Qazvin Branch, Young Researchers & Elites Club, Qazvin, Iran
[6] Caspian Higher Educ Inst, Qazvin, Iran
关键词
Parallel machine scheduling; Learning effect; Sequence-related setup times; Cat swarm optimization; Power consumption minimization; Interactive artificial bee colony; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM; JOBS; ELIGIBILITY; BEHAVIOR;
D O I
10.1016/j.jclepro.2019.119428
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
This research presents an optimization problem associated with scheduling of unrelated parallel machines considering the simultaneous effects of start-time-related deterioration, position-related learning and sequence-related setup times, with the aim to achieve an optimized value for the mean weighted tardiness and power consumption minimization. A workaround is proposed and served as the converter for solving the Mixed Integer Programming (MIP) problem by the continuous-based metaheuristic algorithms. Knowing the NP-hard nature of the problem, three metaheuristic algorithms, namely, Genetic Algorithm (GA), Cat Swarm Optimization (CSO) and Interactive Artificial Bee Colony (IABC), are employed to obtain quality solutions within acceptable computation time. A unique elitism strategy is introduced in the conventional CSO to reduce the computational time of its seeking mode and to provide improved solution, with the new algorithm form called CSO-Elit. Furthermore, a compact solution expression form is proposed for the use of GA, CSO-Elit and IABC to reduce the number of constraints. With the newly proposed model, many essential constraints are automatically built into the solution representation. Accordingly, the efficiency of algorithms is compared with LINGO regarding the quality of solutions, computational time, and overall power consumption using two sets of problems in small and large scales. In solving the small-scale cases, no statistically meaningful difference was observed between LINGO, GA and CSO-Elit, while in large-scale instances CSO-Elit demonstrated higher performance. The contributions of this paper lie in modeling a complex parallel machines problem considering power consumption minimization and proposing a new form of CSO algorithm with elitism strategy to reduce the computational time. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:15
相关论文
共 72 条
[1]   Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing [J].
Abikarram, Jose Batista ;
McConky, Katie ;
Proano, Ruben .
JOURNAL OF CLEANER PRODUCTION, 2019, 208 :232-242
[2]   A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches [J].
Afzalirad, Mojtaba ;
Rezaeian, Javad .
APPLIED SOFT COMPUTING, 2017, 50 :109-123
[3]   Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions [J].
Afzalirad, Mojtaba ;
Rezaeian, Javad .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 98 :40-52
[4]   Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints [J].
Afzalirad, Mojtaba ;
Rezaeian, Javad .
ENGINEERING OPTIMIZATION, 2016, 48 (04) :706-726
[5]  
[Anonymous], TR06 ERC U COMP ENG
[6]  
[Anonymous], P 2013 3 IEEE INT C
[7]  
[Anonymous], P NATO ADV STUDY RES
[8]   Multi-objective fuzzy parallel machine scheduling problems under fuzzy job deterioration and learning effects [J].
Arik, Oguzhan Ahmet ;
Toksari, M. Duran .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (07) :2488-2505
[9]   Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times [J].
Arroyo, Jose Elias C. ;
Leung, Joseph Y. -T. .
COMPUTERS & OPERATIONS RESEARCH, 2017, 78 :117-128
[10]   A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server [J].
Bektur, Gulcin ;
Sarac, Tugba .
COMPUTERS & OPERATIONS RESEARCH, 2019, 103 :46-63