A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling

被引:96
作者
Chen, Jing-fang [1 ]
Wang, Ling [1 ]
Peng, Zhi-ping [2 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
[2] Guangdong Univ Petrochem Technol, Sch Comp, Maoming 525000, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Distributed no-idle flow-shop; Energy-efficient multi-objective scheduling; Collaborative optimization algorithm; Competitive; Local intensification; CARBON FOOTPRINT; SEARCH ALGORITHM; PERMUTATION; CONSUMPTION; MAKESPAN; ELECTRICITY;
D O I
10.1016/j.swevo.2019.100557
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Facing the energy crisis, manufacturers is paying much attention to the energy-efficient scheduling by taking both economic benefits and energy conservation into account. Meanwhile, with the economic globalization, it is significant to facilitate the advanced manufacturing and scheduling in the distributed way. This paper addresses the energy-efficient distributed no-idle permutation flow-shop scheduling problem (EEDNIPFSP) to minimize makespan and total energy consumption simultaneously. By analyzing the characteristics of the problem, several properties are derived. To solve the problem effectively, a collaborative optimization algorithm (COA) is proposed by using the properties and some collaborative mechanisms. First, two heuristics are collaboratively utilized for population initialization to guarantee certain quality and diversity. Second, multiple search operators collaborate in a competitive way to enhance the exploration adaptively. Third, different local intensification strategies are designed for the dominated and non-dominated individuals to enhance the exploitation. Fourth, a speed adjusting strategy for the non-critical operations is designed to improve total energy consumption. The effect of key parameters is investigated using the design-of-experiment with full factorial setting. Comparisons based on extensive numerical tests are carried out, which demonstrate the effectiveness of the proposed algorithm in solving the EEDNIPFSP.
引用
收藏
页数:12
相关论文
共 46 条
[1]   A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion [J].
Bargaoui, Hafewa ;
Driss, Olfa Belkahla ;
Ghedira, Khaled .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 111 :239-250
[2]  
Chan F.T., 2015, EXPERT SYST APPL, V29, P364
[3]   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
[4]  
Chen JF, 2018, CHIN CONTR CONF, P2278, DOI 10.23919/ChiCC.2018.8483752
[5]   Minimising makespan in distributed mixed no-idle flowshops [J].
Cheng, Chen-Yang ;
Ying, Kuo-Ching ;
Chen, Hsia-Hsiang ;
Lu, Hsiao-Shan .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2019, 57 (01) :48-60
[6]   Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm [J].
Dai, Min ;
Tang, Dunbing ;
Giret, Adriana ;
Salido, Miguel A. ;
Li, W. D. .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2013, 29 (05) :418-429
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]   A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem [J].
Deng, Jin ;
Wang, Ling .
SWARM AND EVOLUTIONARY COMPUTATION, 2017, 32 :121-131
[9]   Carbon-efficient scheduling of flow shops by multi-objective optimization [J].
Ding, Jian-Ya ;
Song, Shiji ;
Wu, Cheng .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 248 (03) :758-771
[10]   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