An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
Presents an algorithm that solves the constant capacities economic lot-sizing problem, with concave production costs and linear holdings cost in O(T3) time. Notations used; Results of a greedy algorithm; Global algorithm for solving lot-sizing problems.
|Keywords||econometric models, economic lot size|
van Hoesel, C.P.M., & Wagelmans, A.P.M.. (1996). An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities. Management Science, 142–150. Retrieved from http://hdl.handle.net/1765/2305