Samenvatting
A class of strong valid inequalities for the discrete lot-sizing and scheduling problem is presented. Necessary and sufficient conditions are derived for valid inequalities in this class to be facet-defining. The separation problem for these inequalities is shown to be solvable in polynomial time by dynamic programming.
Originele taal-2 | Engels |
---|---|
Plaats van productie | Eindhoven |
Uitgeverij | Technische Universiteit Eindhoven |
Aantal pagina's | 18 |
Status | Gepubliceerd - 1993 |
Publicatie series
Naam | Memorandum COSOR |
---|---|
Volume | 9308 |
ISSN van geprinte versie | 0926-4493 |