Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling

Abstract

The scheduling literature is abundant on approximate methods for permutation flowshop scheduling, as this problem is NP-hard for the majority of objectives usually considered. Among these methods, some of the most efficient ones use an insertion-type of neighbourhood to construct high-quality solutions. It is not then surprising that using accelerations to speed up the computation of the objective function can greatly reduce the running time of these methods, since a good part of their computational effort is spent in the evaluation of the objective function. Undoubtedly, the best-known of these accelerations has been employed for makespan minimisation (commonly denoted as Taillard’s accelerations). These accelerations have been extended to other related problems, but they cannot be employed for the classical permutation flowshop problem if the objective is other than the makespan. In these cases, other types of accelerations have been proposed, but they are not able to achieve a substantial reduction of the computational effort.In this paper, we propose a new speed-up procedure for permutation flowshop scheduling using objectives related to completion times. We first present some theoretical insights based on the concept of critical path. We also provide an efficient way to compute the critical path (indeed Taillard’s accelerations appear as a specific case of these results). The results show that the computational effort is substantially reduced for total completion time, total tardiness, and total earliness and tardiness, thus outperforming the existing accelerations for these problems.