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

S. Hoesel, van, A.W.J. Kolen

Research output: Contribution to journalArticleAcademicpeer-review

25 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)342-353
Number of pages12
JournalEuropean Journal of Operational Research
Volume75
Issue number2
DOIs
Publication statusPublished - 1994

Fingerprint Dive into the research topics of 'A linear description of the discrete lot-sizing and scheduling problem'. Together they form a unique fingerprint.

Cite this