Dynamic Cascaded Flow-Shop Scheduling Using an Evolutionary Greedy Algorithm

doi:10.1109/TEVC.2025.3541959

Dynamic Cascaded Flow-Shop Scheduling Using an Evolutionary Greedy Algorithm

2025-01-01

0

PRE

AI

DOI：10.1109/TEVC.2025.3541959

Original

Original request for help

Save

Abstract

En 中文

Production processes are inherently complex, often involving multiple production phases from raw materials to finished products, making joint scheduling problems a focal point of research. This article addresses the dynamic cascaded flowshop joint scheduling problem, which integrates a distributed permutation flowshop in Phase 1 and a hybrid flowshop in Phase 2. The challenge involves both initial scheduling and dynamic response mechanisms for new job insertions. We propose an evolutionary greedy algorithm (EGA) aimed at minimizing total flowtime. The EGA employs a multistart cooperative framework tailored to problem characteristics, alternating between a population-based EGA for Phase 1 and an elitist-based greedy algorithm for Phase 2 to generate a robust and complete schedule. Upon new job insertions, three heuristic-driven response strategies enhance solution stability and adaptability. In addition, phase-specific hybrid local search operators and an adaptive insertion strategy, leveraging knowledge-based problem properties, further improve solution quality and search efficiency. The experimental results indicate that the EGA outperforms five state-of-the-art algorithms, achieving an average improvement of 39% in RPI values across 480 instances. Moreover, the proposed local search mechanisms and dynamic response strategies significantly enhance its performance. Thus, the EGA is well-suited for addressing the studied problem.

Keywords:

Cascaded flowshop

dynamic evolutionary algorithm (EA)

dynamic scheduling

iterated greedy (IG)

rescheduling

Dynamic Cascaded Flow-Shop Scheduling Using an Evolutionary Greedy Algorithm

Abstract

Journal

Organization