Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption

Abstract

Blocking flow shop scheduling problem has been extensively studied in recent years; however, some applications mentioned for this problem have some additional characteristics that have not been well considered. Multi-task flexibility of machines and preemption are two of such characteristics. Multi-task flexible machines are capable of processing the operations of at least one other machine in the system. In addition, if preemption is allowed, the solution space grows, and solutions that are more efficient may be obtained. In this study, the two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption is investigated by considering the minimization of makespan as criterion. It is proved that the complexity of the problem is strongly NP-hard. Because of preemption and multi-task flexibility, there are infinite schedules for each sequence; however, it is shown that a dominant schedule can be defined for each sequence. Two mathematical models are proposed for optimally solving the small-sized instances. Furthermore, a variable neighborhood search algorithm (VNS) and a new variant of it, namely, dynamic VNS (DVNS), are presented to find high quality solutions for large-sized instances. Unlike the VNS algorithm, the DVNS algorithm does not need tuning for the shaking phase. Nevertheless, computational results show that DVNS has even a slightly better performance. The VNS and DVNS algorithms are also compared with some of the best-performing metaheuristics already developed for the flow shop scheduling problem with blocking and minimization of makespan as criterion. Computational results reveal that both algorithms are superior to the others for large-sized instances.