Research on Dynamic Flexible Job Shop Scheduling Problem for Energy Consumption

Authors

Chen Chao, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Wuxi 214122, China;
Wang Yan, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Wuxi 214122, China;
Dahu Yan, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Wuxi 214122, China;
Zhicheng Ji, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Wuxi 214122, China;

Abstract

Abstract: In order to solve the problem of uneven load and energy consumption under disturbance, a flexible job shop scheduling model with average flow time and energy consumption was constructed. Aiming at the above model, a genetic and simulated annealing algorithm (GASA) was designed, which is based on the genetic algorithm and the simulated annealing algorithm. A new group of individuals were generated by genetic algorithm. And then the individual simulated the annealing process, in order to avoid falling into the local optimal. Aiming at the dynamic flexible job shop scheduling problem, the rolling window technique and GASA algorithm were combined and applied in the case of machine disturbance. The effectiveness of the algorithm was proved by the simulation of an instance.

Recommended Citation

Chao, Chen; Yan, Wang; Yan, Dahu; and Ji, Zhicheng (2020) "Research on Dynamic Flexible Job Shop Scheduling Problem for Energy Consumption," Journal of System Simulation: Vol. 29: Iss. 9, Article 40.
DOI: 10.16182/j.issn1004731x.joss.201709039
Available at: https://dc-china-simulation.researchcommons.org/journal/vol29/iss9/40

First Page

2168

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201709039

Last Page

2175

CLC

TP278

Recommended Citation

Chen Chao, Wang Yan, Yan Dahu, Ji Zhicheng. Research on Dynamic Flexible Job Shop Scheduling Problem for Energy Consumption[J]. Journal of System Simulation, 2017, 29(9): 2168-2175.

DOI

10.16182/j.issn1004731x.joss.201709039