NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:56, 1 February 2024
scientific article
| 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 |
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
