Low carbon flexible job shop scheduling problem considering worker learning using a memetic algorithm

被引:1
作者
Huan Zhu
Qianwang Deng
Like Zhang
Xiang Hu
Wenhui Lin
机构
[1] Hunan University,State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body
来源
Optimization and Engineering | 2020年 / 21卷
关键词
Carbon emission; Flexible job shop scheduling problem; Worker learning; Memetic algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
Green low carbon flexible job shop problems have been extensively studied in recent decades, while most of them ignore the influence of workers. In this paper, we take workers into account and consider the effects of their learning abilities on the processing time and energy consumption. And then a new low carbon flexible job shop scheduling problem considering worker learning (LFJSP-WL) is investigated. To reduce carbon emission (CE), a novel CE assessment of machines is presented which combines the production scheduling strategies based on worker learning. A memetic algorithm (MA) is tailored to solve the LFJSP-WL with objectives of minimizing the makespan, total CE and total cost of workers. In LFJSP-WL, a three-layer chromosome encoding method is adopted and several approaches considering the problem characteristics are designed in population initialization, crossover and mutation. Besides, four effective neighborhood structures are developed to enhance the exploitation and exploration capacities, and the elite pool strategy is presented to reserve elite solutions along each iteration. The Taguchi method of DOE is used to obtain the best combination of the key parameters used in MA. Computational experiments conducted show that the MA is able to easily obtain better solutions for most of the tested 22 challenging problem instances compared to two other well-known algorithms, demonstrating its superior performance for the proposed LFJSP-WL.
引用
收藏
页码:1691 / 1716
页数:25
相关论文
共 137 条
[1]  
Ballestin F(2012)Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm Optim Eng 13 663-687
[2]  
Mallor F(1999)Single-machine scheduling with learning considerations Eur J Oper Res 115 173-178
[3]  
Mateo PM(2008)A state-of-the-art review on scheduling with learning effects Eur J Opera Res 188 315-329
[4]  
Biskup D(1993)Routing and scheduling in a flexible job shop by tabu search Ann Oper Res 41 157-183
[5]  
Biskup D(1990)Job-shop scheduling with multi-purpose machines Computing 45 369-375
[6]  
Brandimarte P(1997)An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Ann Oper Res 70 281-306
[7]  
Brucker P(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 182-197
[8]  
Schlie R(2014)An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations Int J Prod Res 52 3905-3921
[9]  
Dauzèrepérès S(1999)A genetic algorithm based approach for scheduling of dual-resource constrainded manufacturing systems CIRP Ann-Manuf Technol 48 369-372
[10]  
Paulli J(2001)Multi-level heterogeneous worker flexibility in a dual resource constrained (DRC) job-shop Int J Prod Res 39 3041-3059