MILP-based local search procedures for minimizing total tardiness in the No-idle Permutation Flowshop Problem

Andrea Balogh, Michele Garraffa, Barry O’Sullivan, Fabio Salassa

Computers & Operations Research · 2022 · 22 citations · 38 references

DOIFull text

Open access

Concepts

Abstract

We consider the No-idle Permutation Flowshop Scheduling Problem (NPFSP) with a total tardiness criterion. We present two Mixed Integer Linear Programming (MILP) formulations based on positional and precedence variables, respectively. We study six local search procedures that explore two different neighborhoods by exploiting the MILP formulations. Our computational experiments show that two of the proposed procedures strongly outperform the state-of-the-art metaheuristic. We update 63% of the best known solutions of the instances in Taillards’ benchmark, and 77% if we exclude those instances for which we proved that the previous best known solutions are optimal.

References

38