Mathematical optimization problems including a time dimension abound. For example,
logistics, process optimization and production planning tasks must often be optimized for a …

In this paper, we propose a simple but efficient heuristic that combines construction and
improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic …

In this paper, a new fix-and-optimize (FO) approach is proposed for two dynamic multi-level
capacitated lot sizing problems (MLCLSP), the MLCLSP without setup carryover and the …

We study a capacitated multi-item lot sizing problem with nonidentical machines. For the
problem, we propose several mathematical formulations and their per-item and per-period …

This paper considers the multi-item inventory lot-sizing problem with supplier selection. The
problem consists of determining an optimal purchasing plan in order to satisfy dynamic …

Due to the stricter government regulations on end-of-life product treatment and the
increasing public awareness towards environmental issues, remanufacturing has been a …

We introduce horizon decomposition in the context of Dantzig-Wolfe decomposition, and
apply it to the capacitated lot-sizing problem with setup times. We partition the problem …

We consider the multi-item uncapacitated lot-sizing problem with inventory bounds, in which
a production plan for multiple items has to be determined considering that they share a …

The coupled lot-sizing and cutting-stock problem has been a challenging and significant
problem for industry, and has therefore received sustained research attention. The quality of …

Despite the significant attention they have drawn, big-bucket lot-sizing problems remain
notoriously difficult to solve. Previous literature contained results (computational and …