A cascaded flowshop joint scheduling problem with makespan minimization: A mathematical model and shifting iterated greedy algorithm

This paper studies a cascaded flowshop joint scheduling problem that has critical applications in the electronic information equipment manufacturing industry but has received limited attention in the scheduling field. The cascaded flowshop joint scheduling problem encompasses both a distributed permutation flowshop scheduling problem and a hybrid flowshop scheduling problem. This paper investigates the efficient scheduling of a set of jobs in two heterogeneous flowshops to minimize the makespan. We present a mixed integer linear programming mathematical model and a shifting iterated greedy algorithm, which constantly changes its search space to explore different solution spaces. Based on the specific characteristics of the problem, a hybrid scheduling approach that combines forward and backward scheduling, a step-by-step destruction and reconstruction operator, and three adaptive reconstructive methods that combine coarse-tuning and fine-tuning are proposed to explore the near-optimal solution. Through comprehensive computational comparison and statistical analysis, the results demonstrate that the proposed shifting iterated greedy algorithm performs significantly better in relative deviation index values at the same CPU running time.