An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production

被引:106
作者
Wang, Shijin [1 ]
Wang, Xiaodong [1 ]
Chu, Feng [2 ,3 ]
Yu, Jianbo [4 ]
机构
[1] Tongji Univ, Sch Econ & Management, Shanghai, Peoples R China
[2] Univ Paris Saclay, Univ Evry, IBISC, Paris, France
[3] Fuzhou Univ, Sch Econ & Management, Fuzhou, Fujian, Peoples R China
[4] Tongji Univ, Sch Mech Engn, Shanghai, Peoples R China
基金
美国国家科学基金会;
关键词
two-stage hybrid flow shop; total energy consumption; epsilon-constraint method; constructive heuristic; bi-objective tabu search; bi-objective ant colony optimisation; FLEXIBLE JOB-SHOP; TOTAL WEIGHTED TARDINESS; MULTIOBJECTIVE GENETIC ALGORITHM; TOTAL COMPLETION-TIME; SINGLE-MACHINE; ELECTRICITY CONSUMPTION; OBJECTIVE OPTIMIZATION; MINIMIZING MAKESPAN; PARALLEL MACHINES; LOCAL SEARCH;
D O I
10.1080/00207543.2019.1624857
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Energy-efficient scheduling is highly necessary for energy-intensive industries, such as glass, mould or chemical production. Inspired by a real-world glass-ceramics production process, this paper investigates a bi-criteria energy-efficient two-stage hybrid flow shop scheduling problem, in which parallel machines with eligibility are at stage 1 and a batch machine is at stage 2. The performance measures considered are makespan and total energy consumption. Time-of-use (TOU) electricity prices and different states of machines (working, idle and turnoff) are integrated. To tackle this problem, a mixed integer programming (MIP) is formulated, based on which an augmented epsilon-constraint (AUGMECON) method is adopted to obtain the exact Pareto front. A problem-tailored constructive heuristic method with local search strategy, a bi-objective tabu search algorithm and a bi-objective ant colony optimisation algorithm are developed to deal with medium- and large-scale problems. Extensive computational experiments are conducted, and a real-world case is solved. The results show effectiveness of the proposed methods, in particular the bi-objective tabu search.
引用
收藏
页码:2283 / 2314
页数:32
相关论文
共 78 条
[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]   Energy efficient scheduling problems under Time-Of-Use tariffs with different energy consumption of the jobs [J].
Aghelinejad, MohammadMohsen ;
Ouazene, Yassine ;
Yalaoui, Alice .
IFAC PAPERSONLINE, 2018, 51 (11) :1053-1058
[3]   Production scheduling optimisation with machine state and time-dependent energy costs [J].
Aghelinejad, MohammadMohsen ;
Ouazene, Yassine ;
Yalaoui, Alice .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (16) :5558-5575
[4]  
[Anonymous], 1992, PhD thesis
[5]   An exact ε-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits [J].
Berube, Jean-Francois ;
Gendreau, Michel ;
Potvin, Jean-Yves .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 194 (01) :39-50
[6]   Energy-aware scheduling for improving manufacturing process sustainability: A mathematical model for flexible flow shops [J].
Bruzzone, A. A. G. ;
Anghinolfi, D. ;
Paolucci, M. ;
Tonelli, F. .
CIRP ANNALS-MANUFACTURING TECHNOLOGY, 2012, 61 (01) :459-462
[7]   Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs [J].
Che, Ada ;
Zhang, Shibohua ;
Wu, Xueqi .
JOURNAL OF CLEANER PRODUCTION, 2017, 156 :688-697
[8]   Energy-efficient bi-objective single-machine scheduling with power-down mechanism [J].
Che, Ada ;
Wu, Xueqi ;
Peng, Jing ;
Yan, Pengyu .
COMPUTERS & OPERATIONS RESEARCH, 2017, 85 :172-183
[9]   An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs [J].
Che, Ada ;
Zeng, Yizeng ;
Lyu, Ke .
JOURNAL OF CLEANER PRODUCTION, 2016, 129 :565-577
[10]   Scheduling with time-of-use costs [J].
Chen, Bo ;
Zhang, Xiandong .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (03) :900-908