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
Removed claim: author (P16): Item:Q1297697 |
Changed an Item |
||
| Property / author | |||
| Property / author: Atidel Ben Hadj-Alouane / rank | |||
Normal rank | |||
Revision as of 17:35, 22 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
