Improved Shuffled Frog-Leaping Algorithm for Solving Flexible Job Shop Scheduling Problem

Authors

Xiaoxing Zhang, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;
Wang Yan, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;
Dahu Yan, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;
Zhicheng Ji, Engineering Research Center of Internet of Things Technology Applications Ministry of Education, Jiangnan University, Wuxi 214122, China;

Abstract

Abstract: Aiming at the characteristics of flexible job shop scheduling problem, a multi-objective scheduling model with maximum completion time and minimum energy consumption was proposed. An improved shuffled frog leaping algorithm was developed. By designing the local updating strategy based on crossover operation of maximum preserved crossover (MPX) and shifting operation of single parent gene algorithm (PGA), it avoided the illegal solution and trimming of the algorithm. Additionally, it accelerated optimization rate of the algorithm. And the optimal solution of the group was optimized by the simplified neighborhood optimization strategy to prevent the algorithm from falling into the local optimum. Then, by solving an example of an enterprise production workshop, scheduling schemes under different weights were obtained. Compared with completion time and processing energy consumption obtained by the classical shuffled frog-leaping algorithm, it proves the effectiveness of the algorithm.

Recommended Citation

Zhang, Xiaoxing; Yan, Wang; Yan, Dahu; and Ji, Zhicheng (2020) "Improved Shuffled Frog-Leaping Algorithm for Solving Flexible Job Shop Scheduling Problem," Journal of System Simulation: Vol. 29: Iss. 9, Article 29.
DOI: 10.16182/j.issn1004731x.joss.201709029
Available at: https://dc-china-simulation.researchcommons.org/journal/vol29/iss9/29

First Page

2093

DOI Link

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

Last Page

2099

CLC

TP278

Recommended Citation

Zhang Xiaoxing, Wang Yan, Yan Dahu, Ji Zhicheng. Improved Shuffled Frog-Leaping Algorithm for Solving Flexible Job Shop Scheduling Problem[J]. Journal of System Simulation, 2017, 29(9): 2093-2099.

DOI

10.16182/j.issn1004731x.joss.201709029