Energy-Efficient Scheduling Problem Using an Effective Hybrid Multi-Objective Evolutionary Algorithm

被引:30
作者
Yin, Lvjiang [1 ,2 ]
Li, Xinyu [1 ]
Lu, Chao [1 ]
Gao, Liang [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Mech Sci & Engn, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China
[2] Hubei Univ Automot Technol, Sch Econ & Management, Shiyan 442002, Peoples R China
来源
SUSTAINABILITY | 2016年 / 8卷 / 12期
基金
中国国家自然科学基金;
关键词
multi-objective evolutionary algorithm; energy efficient scheduling; controllable processing times; single machine scheduling; just-in-time; CONTROLLABLE PROCESSING TIMES; TOTAL WEIGHTED TARDINESS; SINGLE-MACHINE; MINIMIZING EARLINESS; POWER-CONSUMPTION; COSTS; MINIMIZATION; STRATEGIES;
D O I
10.3390/su8121268
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Nowadays, manufacturing enterprises face the challenge of just-in-time (JIT) production and energy saving. Therefore, study of JIT production and energy consumption is necessary and important in manufacturing sectors. Moreover, energy saving can be attained by the operational method and turn off/on idle machine method, which also increases the complexity of problem solving. Thus, most researchers still focus on small scale problems with one objective: a single machine environment. However, the scheduling problem is a multi-objective optimization problem in real applications. In this paper, a single machine scheduling model with controllable processing and sequence dependence setup times is developed for minimizing the total earliness/tardiness (E/T), cost, and energy consumption simultaneously. An effective multi-objective evolutionary algorithm called local multi-objective evolutionary algorithm (LMOEA) is presented to tackle this multi-objective scheduling problem. To accommodate the characteristic of the problem, a new solution representation is proposed, which can convert discrete combinational problems into continuous problems. Additionally, a multiple local search strategy with self-adaptive mechanism is introduced into the proposed algorithm to enhance the exploitation ability. The performance of the proposed algorithm is evaluated by instances with comparison to other multi-objective meta-heuristics such as Nondominated Sorting Genetic Algorithm II (NSGA-II), Strength Pareto Evolutionary Algorithm 2 (SPEA2), Multiobjective Particle Swarm Optimization (OMOPSO), and Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D). Experimental results demonstrate that the proposed LMOEA algorithm outperforms its counterparts for this kind of scheduling problems.
引用
收藏
页数:33
相关论文
共 53 条
[1]  
[Anonymous], 2001, P 5 C EVOLUTIONARY M
[2]   Minimizing earliness and tardiness costs in stochastic scheduling [J].
Baker, Kenneth R. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (02) :445-452
[3]   Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance [J].
Benmansour, Rachid ;
Allaoui, Hamid ;
Artiba, Abdelhakim ;
Hanafi, Said .
COMPUTERS & OPERATIONS RESEARCH, 2014, 47 :106-113
[4]   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
[5]  
Dahmus J.B., 2004, P IMECE 2004 2004 AS
[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]  
Deb K., 1995, Complex Systems, V9, P115
[9]  
Dietmair A., 2009, Modern Machinery Science Journal, V2, P62, DOI DOI 10.1007/S00170-012-4245-6
[10]  
Drake R., 2006, P IIE ANN C EXP ORL