|
Volumn 222, Issue 1, 2012, Pages 10-16
|
A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
|
Author keywords
Capacity constraint; Lot sizing; Minimum order quantity; Polynomial time algorithm
|
Indexed keywords
CAPACITATED LOT SIZING PROBLEM;
CAPACITY CONSTRAINTS;
CONCAVE COST;
LOT SIZING;
MINIMUM ORDER QUANTITIES;
PLANNING HORIZONS;
POLYNOMIAL-TIME ALGORITHMS;
PRODUCTION CAPACITY;
STORAGE COSTS;
ENTERPRISE RESOURCE PLANNING;
POLYNOMIAL APPROXIMATION;
PROBLEM SOLVING;
|
EID: 84861796333
PISSN: 03772217
EISSN: None
Source Type: Journal
DOI: 10.1016/j.ejor.2012.04.024 Document Type: Article |
Times cited : (26)
|
References (13)
|