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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2016.07.028 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2016.07.028 / rank | |||
Normal rank | |||
Latest revision as of 08:19, 11 December 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
0 references
0 references
0 references
0 references
0 references
0 references
