MIP-based local search for permutation flowshop scheduling with makespan objective

Abstract

The permutation flowshop scheduling problem with makespan objective, or PFM for short, is a classic NP-hard scheduling problem. At present, the most promising heuristics for the PFM are based on variations of local search. This led us to consider five new neighbourhoods for the PFM. Each neighbourhood is of exponential size, but can be explored quite quickly by solving a small mixed-integer program. We propose a matheuristic framework that incorporates our proposed neighbourhoods to evaluate and compare their effectiveness. Extensive computational experiments show that integrating our best neighbourhood to the proposed matheuristic reduces the makespan by over 60% on average, compared to the variant without it, on both the classical Taillard benchmark instances and the more recent instances proposed by Vallada, Ruiz and Framinan.