Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption

被引:257
作者
Zhang, Rui [1 ]
Chiong, Raymond [2 ]
机构
[1] Xiamen Univ Technol, Sch Management, Xiamen 361024, Peoples R China
[2] Univ Newcastle, Sch Design Commun & Informat Technol, Callaghan, NSW 2308, Australia
关键词
Job shop scheduling; Energy efficiency; Genetic algorithm; Multi-objective optimization; SHIFTING BOTTLENECK PROCEDURE; POWER-CONSUMPTION; OPTIMIZATION; TIME;
D O I
10.1016/j.jclepro.2015.09.097
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
In recent years, there has been a growing concern over the environmental impact of traditional manufacturing, especially in terms of energy consumption and related emissions of carbon dioxide. Besides the adoption of new equipment, production scheduling could play a key role in reducing the total energy consumption of a manufacturing plant. In this paper, we explicitly introduce the objective of minimizing energy consumption into a typical production scheduling model, i.e., the job shop scheduling problem, based on a machine speed scaling framework. To solve this bi-objective optimization problem, we propose a multi-objective genetic algorithm incorporated with two problem-specific local improvement strategies. These local improvement procedures aim to enhance the solution quality by utilizing the mathematical models of two restricted subproblems derived from the original problem. Comprehensive computational experiments have been carried out to verify the effectiveness of the proposed solution approach. The results presented in this work may be useful for future research on energy-efficient production scheduling. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3361 / 3375
页数:15
相关论文
共 40 条
[1]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[2]  
[Anonymous], COMPUT OPER RES
[3]   Guided local search with shifting bottleneck for job shop scheduling [J].
Balas, E ;
Vazacopoulos, A .
MANAGEMENT SCIENCE, 1998, 44 (02) :262-275
[4]  
Blum C, 2012, VARIANTS OF EVOLUTIONARY ALGORITHMS FOR REAL-WORLD APPLICATIONS, P1
[5]  
Brucker P., 1977, Ann. Discrete Math., V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[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 genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem [J].
Essafi, Imen ;
Mati, Yazid ;
Dauzere-Peres, Stephane .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) :2599-2616
[9]   Flow shop scheduling with peak power consumption constraints [J].
Fang, Kan ;
Uhan, Nelson A. ;
Zhao, Fu ;
Sutherland, John W. .
ANNALS OF OPERATIONS RESEARCH, 2013, 206 (01) :115-145
[10]   An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling [J].
Goncalves, Jose Fernando ;
Resende, Mauricio G. C. .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2014, 21 (02) :215-246