Journal of System Simulation ›› 2021, Vol. 33 ›› Issue (11): 2579-2588.doi: 10.16182/j.issn1004731x.joss.21-FZ0704

Previous Articles     Next Articles

Research on Flexible Job-shop Dynamic Scheduling Based on Game Theory

You Yichen, Wang Yan*, Ji Zhicheng   

  1. Jiangnan University Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Wuxi 214122, China
  • Received:2021-04-17 Revised:2021-07-17 Online:2021-11-18 Published:2021-11-17

Abstract: To quickly and effectively respond to the machine fault disturbance events in Flexible Job-shop Scheduling Problem (FJSP), a flexible job-shop dynamic scheduling based on game theory is established. A pre-scheduling scheme is generated under Non-Dominated Sort Genetic Algorithm-Ⅱ (NSGA-Ⅱ) algorithm which introduces self-adapted crossover operators to improve the population diversity. For FJSP dynamic scheduling with machine fault, a multi-stage complete information game model is built to better balance the stability and robustness indicators and respond quickly to the machine fault, in which the stability and robustness indicators are mapped to the game players, and a hybrid Nash Equilibrium which combines Nash Equilibrium and Pareto optimum is presented to get the dynamic scheduling scheme. The simulation experiment proves the effectiveness of the presented strategy in solving flexible job-shop dynamic scheduling problem.

Key words: flexible job-shop, machine fault, Non-Dominated Sort Genetic Algorithm-Ⅱ (NSGA-Ⅱ), robustness, stability, hybrid Nash Equilibrium

CLC Number: