•  
  •  
 

Journal of System Simulation

Abstract

Abstract: In view of the no-wait flow shop problem (NWFSP) widely existing in the manufacturing industry, an improved discrete state transition algorithm (IDSTA) is proposed to solve the problem. The coding mode of the workpiece is designed based on the characteristics of the flow shop scheduling problem (FSSP). The initial solution is constructed by the Nawaz-Enscore-Ham (NEH) method with the standard deviation of the processing time of the workpiece as the priority, and a multi-neighborhood combinatorial search strategy based on insertion and exchange is designed to improve the quality of the initial solution. A discrete state transition algorithm (DSTA) based on group state is proposed, and the search range of the algorithm is expanded by using three discrete operators with quadratic state transition operations. In order to further improve the solution performance of DSTA, a local search method based on Levy flight for damage reconstruction is designed, and the high-quality solution detected by global search is searched carefully. The simulation experiments show that IDSTA can effectively solve the NWFSP.

First Page

1034

Revised Date

2022-03-28

Last Page

1045

CLC

TP301.6

Recommended Citation

Jiaying Yu, Hongli Zhang, Yingchao Dong. Research on No-Wait Flow Shop Scheduling Based on Discrete State Transition Algorithm[J]. Journal of System Simulation, 2023, 35(5): 1034-1045.

Corresponding Author

Hongli Zhang,zhlxju@163.com

DOI

10.16182/j.issn1004731x.joss.22-0048

Download

Share

COinS