The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases |
scientific article |
Statements
The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (English)
0 references
28 July 2015
0 references
inventory
0 references
uncapacitated lot sizing
0 references
batch delivery
0 references
stepwise cost
0 references
polynomial time algorithm
0 references
complexity
0 references
0 references
0 references
0 references
