Tabu search and lower bound for an industrial complex shop scheduling problem

This paper deals with an industrial shop scheduling problem that arises in a metal goods production group. The scheduling problem can be seen as a multi-mode job shop with assembly. Jobs have additional constraints such as release date, due date and sequence-dependent setup times. The aim of the decision-makers is to minimize the maximum lateness. This article introduces a tabu search procedure to solve the whole problem and a valid lower bound used to evaluate the tabu search procedure.

► We model an industrial shop scheduling problem as a multi-mode jobshop with assembly. ► We deal with release dates, due dates and sequence-dependent setup times. ► The aim purchased by the decision-makers is to minimize the maximum lateness. ► We propose a tabu search with new filtering and guiding procedures. ► We compute a valid lower bound taking into account the multi-mode aspect.