A linear description of the discrete lot-sizing and scheduling problem

A linear description of the discrete lot-sizing and scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor1998128
Country: Netherlands
Volume: 75
Issue: 2
Start Page Number: 342
End Page Number: 353
Publication Date: Jun 1994
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: dynamic
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.