The capacitated production planning problem with sequence-dependent changeovers

This paper addresses the multi-machine multi-item capacitated production planning problem with sequence-dependent changeovers that faced by most process industries. A new mixed-integer programming model formulation and its incorporation into a fix-and-relax heuristic are proposed. Numerical studies from test instances of different size exhibit that the developed heuristic approach is capable of solving large instances within a reasonable amount of time and indicate superior solution qualities.