A new integer linear programming formulation for the discrete lot-sizing and scheduling problem is presented. This polynomial-size formulation is obtained from the model with the natural variables by splitting these variables. Its linear programming relaxation is shown to be tight, by reformulating it as a shortest path problem. The latter also provides a dynamic programming formulation for the discrete lot-sizing and scheduling problem.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Number of pages||14|
|Publication status||Published - 1992|