Mathematical Programming-based Heuristics for Production Planning

We develop construction and improvement heuristics to solve the single and parallelmachine capacitated-lotsizing and scheduling problem with sequence dependent setup times and costs. We compare the performance of these heuristics to metaheuristics and other MIP-based heuristics that have been proposed in the literature as well as a state-of-the-art commercial solver. Computational experiments show the eectiveness and eciency of the proposed approach in solving medium size problems.