NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract |
scientific article; zbMATH DE number 6872944
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract |
scientific article; zbMATH DE number 6872944 |
Statements
NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (English)
0 references
24 May 2018
0 references
inventory
0 references
lot sizing
0 references
capacity reservation contract
0 references
complexity
0 references
polynomial time algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
