On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose solving it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Computational results confirm the benefits of the proposed solution procedure.