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 the normal view instead:
scientific article; zbMATH DE number 6872944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8430078625679016
0 references
0.8127463459968567
0 references
0.7853183746337891
0 references
0.7844114303588867
0 references
