Optimal Scheduling of Flow Shop Based on Genetic Algorithm

Abstract

With the rapid development of the social economy, the requirements for the production efficiency of job shop have also increased, but the production efficiency of the traditional flow shop is no longer suitable for the efficient speed of economic development. Therefore, it is an urgent task to study the problem of optimal scheduling of flow shop. In this study, the problem of optimal scheduling of the flow shop was taken as the main research subject, the machining sequence and maximum completion time were taken as the key points, a method of optimal scheduling by genetic algorithm (GA) was proposed, and a mathematical model for optimal scheduling of the flow shop based on GA was established. The optimal processing sequence of the six jobs in the production was obtained: 2–1–6–5–4–3; the average completion time was 381.6[Formula: see text]min, and the optimal solution frequency was 0.8. Moreover, the total processing time of the GA-based flow shop was shorter than that of the traditional flow shop. This work provides a new route for the optimal scheduling of flow shop.