Two-stage flexible flow shop scheduling subject to fixed job sequences

This paper investigates the scheduling problem in a two‐stage flexible flow shop, which consists of m stage‐1 parallel dedicated machines and a stage‐2 bottleneck machine, subject to the condition that nl jobs per type l∈{1, …, m} are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage‐2 bottleneck machine. The problem under study is proved to be strongly NP‐hard. An O(m²Πl=1 ^mnl ²) dynamic programming algorithm coupled with numerical experiments is presented.