An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem

2021 ◽  
Vol 155 ◽  
pp. 107211
Author(s):  
Kexin Li ◽  
Qianwang Deng ◽  
Like Zhang ◽  
Qing Fan ◽  
Guiliang Gong ◽  
...  
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

An improved SFLA for flexible job shop scheduling problem considering energy consumption

2018 ◽  
Vol 32 (34n36) ◽  
pp. 1840112 ◽  
Author(s):  
Xiaoxing Zhang ◽  
Zhicheng Ji ◽  
Yan Wang
Keyword(s):  
Energy Consumption ◽  
Energy Saving ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Neighborhood Search ◽  
Flexible Job Shop ◽  
Scheduling Problem ◽  
Flexible Job Shop Scheduling ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

In this paper, a multi-objective flexible job shop scheduling problem (MOFJSP) was studied systematically. A novel energy-saving scheduling model was established based on considering makespan and total energy consumption simultaneously. Different from previous studies, four types of energy consumption were considered in this model, including processing energy, idle energy, transport energy, and turn-on/off energy. In addition, a turn-off strategy is adopted for energy-saving. A modified shuffled frog-leaping algorithm (SFLA) was applied to solve this model. Moreover, operators of multi-point crossover and neighborhood search were both employed to obtain optimal solutions. Experiments were conducted to verify the performance of the SFLA compared with a non-dominated sorting genetic algorithm with blood variation (BVNSGA-II). The results show that this algorithm and strategy are very effective.

Sign in / Sign up

Export Citation Format

Share Document