Journal of System Simulation ›› 2017, Vol. 29 ›› Issue (7): 1497-1505.doi: 10.16182/j.issn1004731x.joss.201707014

Previous Articles     Next Articles

Solving Flexible Job-Shop Scheduling Problem by Improved Chicken Swarm Optimization Algorithm

Xu Shipeng1, Wu Dinghui1,2, Kong Fei1, Ji Zhicheng1   

  1. 1. Key Laboratory of Advanced Process Control for Light Industry, Jiangnan University, Wuxi 214122, China;
    2. Key Laboratory of Advanced Manufacturing Equipment Technology of Food in Jiangsu Province, Wuxi 214122, China
  • Received:2015-08-17 Published:2020-06-01

Abstract: To solve the flexible job-shop scheduling problem (FJSP) more effectively, an improved chicken swarm optimization (ICSO) algorithm was proposed. A flexible job-shop scheduling model was established for the purpose of minimizing the machine makespan. The improved chicken swarm optimization algorithm was presented. Algorithm improved the update formula of chicks and combined the advantages of simulated annealing algorithm and dynamic inertia cosine weight strategy, which achieved an effective balance of global search and local exploration. According to simulating and testing four standard functions and a flexible job shop scheduling model and compared with particle swarm optimization (PSO) and chicken swarm optimization (CSO), makespan of the optimal value of ICSO is reduced by 12 and 7 respectively, and the mean value is reduced by 16.3 and 5.7, validating the effectiveness and the superiority of ICSO.

Key words: flexible job-shop scheduling, improved chicken swarm optimization algorithm, simulated annealing algorithm, dynamic inertia cosine

CLC Number: