Polyhedral and Langrangian approaches for lot sizing with production time windows and setup times

In this paper, we solve the capacitated multi item lot-sizing problem with non-customer specific production time windows and setup times using two approaches: (i) using a Lagrangian relaxation-based heuristic and (ii) using reformulations and a commercial software. The results of the two approaches are analyzed and compared based on randomly generated data sets. The results show that the first approach finds feasible solution more rapidly but a steady state is reached very quickly. On the other hand, the second approach quickly finds good lower bounds and finds good feasible solutions if more CPU time is allowed. It turns out that, for a wide variety of instances varying in size and other parameters, we can obtain feasible solutions with 1-5% of optimal within 10s and also obtain solutions that are guaranteed withing 1-2% of optimal within 60-120