Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times

被引:11
作者
Tasgetiren, M. Fatih [1 ]
Oztop, Hande [2 ]
Eliiyi, Ugur [3 ]
Eliiyi, Deniz Tursel [2 ]
Pan, Quan-Ke [4 ]
机构
[1] Yasar Univ, Dept Int Logist Management, Bornova, Turkey
[2] Yasar Univ, Dept Ind Engn, Bornova, Turkey
[3] Dokuz Eylul Univ, Dept Comp Sci, Izmir, Turkey
[4] Huazhong Univ Sci & Technol, State Key Lab, Wuhan, Hubei, Peoples R China
来源
INTELLIGENT COMPUTING THEORIES AND APPLICATION, PT I | 2018年 / 10954卷
关键词
Energy efficient scheduling; Multi-objective optimization; Heuristic optimization; Sequence-dependent setup times; Weighted tardiness; ITERATED GREEDY ALGORITHM; LOCAL SEARCH; MINIMIZE; CONSUMPTION; MAKESPAN;
D O I
10.1007/978-3-319-95930-6_76
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most of the problems defined in the scheduling literature do not yet take into account the energy consumption of manufacturing processes, as in most of the variants with tardiness objectives. This study handles scheduling of jobs with due dates and sequence-dependent setup times (SMWTSD), while minimizing total weighted tardiness and total energy consumed in machine operations. The trade-off between total energy consumption (TEC) and total weighted tardiness is examined in a single machine environment, where different jobs can be operated at varying speed levels. A bi-objective mixed integer linear programming model is formulated including this speed-scaling plan. Moreover, an efficient multi-objective block insertion heuristic (BIH) and a multi-objective iterated greedy (IG) algorithm are proposed for this NP-hard problem. The performances of the proposed BIH and IG algorithms are compared with each other. The preliminary computational results on a benchmark suite consisting of instances with 60 jobs reveal that, the proposed BIH algorithm is very promising in terms of providing good Pareto frontier approximations for the problem.
引用
收藏
页码:746 / 758
页数:13
相关论文
共 22 条
[1]   A survey of scheduling problems with setup times or costs [J].
Allahverdi, Ali ;
Ng, C. T. ;
Cheng, T. C. E. ;
Kovalyov, Mikhail Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :985-1032
[2]  
[Anonymous], 1999, EVOLUTIONARY ALGORIT
[3]   Enhancing stochastic search performance by value-biased randomization of heuristics [J].
Cicirello, VA ;
Smith, SF .
JOURNAL OF HEURISTICS, 2005, 11 (01) :5-34
[4]  
Diaz N., 2011, Energy consumption characterization and reduction strategies for milling machine tool use, Glocalized Solutions for Sustainability in Manufacturing, P263, DOI DOI 10.1007/978-3-642-19692-8_46
[5]   An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem [J].
Dubois-Lacoste, Jeremie ;
Pagnozzi, Federico ;
Stutzle, Thomas .
COMPUTERS & OPERATIONS RESEARCH, 2017, 81 :160-166
[6]   A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction [J].
Fang, Kan ;
Uhan, Nelson ;
Zhao, Fu ;
Sutherland, John W. .
JOURNAL OF MANUFACTURING SYSTEMS, 2011, 30 (04) :234-240
[7]   Parallel-machine scheduling to minimize tardiness penalty and power cost [J].
Fang, Kuei-Tang ;
Lin, Bertrand M. T. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 64 (01) :224-234
[8]  
Fei XC, 2013, PROCEEDINGS OF THE 2013 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT CONTROL AND INFORMATION PROCESSING (ICICIP), P1
[9]   Scatter search for minimizing weighted tardiness in a single machine scheduling with setups [J].
Gonzalez, Miguel A. ;
Jose Palacios, Juan ;
Vela, Camino R. ;
Hernandez-Arauzo, Alejandro .
JOURNAL OF HEURISTICS, 2017, 23 (2-3) :81-110
[10]   A heuristic to minimize the total weighted tardiness with sequence-dependent setups [J].
Lee, YH ;
Bhaskaran, K ;
Pinedo, M .
IIE TRANSACTIONS, 1997, 29 (01) :45-52