A summary of algorithm research on hybrid flow-shop scheduling problem

The hybrid flow shop scheduling problem is a flow shop scheduling problem that combines the two scheduling characteristics of the classical flow shop and the parallel machine. It is also one of the research hotspots in the field of shop scheduling. In this paper, the algorithm for solving the problem is reviewed, and the research status of the related expansion problems of the mixed flow workshop is summarized. Finally, combined with the development trend, the existing problems in the current research are analyzed, possible solutions are proposed, and the application of the algorithm for solving the problem of mixed flow shop scheduling in new fields in the future is discussed.