Improved algorithms for a lot-sizing problem with inventory bounds and backlogging

Naval Research Logistics

Volumn 59, Issue 3-4, 2012, Pages 244-253

  Hwang, Hark Chin ^a   Van Den Heuvel, Wilco ^b  

^a Chosun University   (South Korea)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

algorithms; inventory and production; lot sizing; storage capacity

Indexed keywords

COST STRUCTURE; DYNAMIC LOT-SIZING; DYNAMIC PROGRAMMING ALGORITHM; FIXED CHARGES; GEOMETRIC TECHNIQUES; IMPROVED ALGORITHM; INVENTORY AND PRODUCTION; INVENTORY BOUNDS; INVENTORY COSTS; LOT SIZING; LOT SIZING PROBLEMS; MATRIX SEARCHING; PLANNING HORIZONS; STORAGE CAPACITY;

COMPUTER SIMULATION; OCEAN ENGINEERING;

ALGORITHMS;

EID: 84859914082     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.21485     Document Type: Article

References (24)

1. A. Aggarwal, M. M. Klawe, S. Moran, P. W. Shor, R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmatica 2 (1987), 195-208.
2. A. Aggarwal, J. K. Park, Improved algorithms for economic lot-size problems, Oper Res 41 (1993), 549-571.
3. A. Atamtürk, S. Küçükyavuz, Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation, Oper Res 53 (2005), 711-730. (Pubitemid 41344633)
4. 2) algorithm for lot sizing with inventory bounds and fixed costs, Oper Res Lett 36 (2008), 297-299. (Pubitemid 351620955)
5. G. S. Brodal, R. Jacob, Dynamic planar convex hull, Proc. 43rd Annual Symp. on Foundations of Computer Science, Vancouver, 2002, pp. 617-626.
6. A. Federgruen, M. Tzur, A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(n log n) or O(n) time, Manage Sci 37 (1991), 909-925. (Pubitemid 23585668)
7. J. Gutiérrez, A. Sedeño-Noda, M. Colebrook, J. Sicilia, A new characterization for the dynamic lot size problem with bounded inventory, Comput Oper Res 30 (2003), 383-395. (Pubitemid 36650126)
8. J. Gutiérrez, A. Sedeño-Noda, M. Colebrook, J. Sicilia, A polynomial algorithm for the production/ordering planning problem with limited storage, Comput Oper Res 34 (2007), 934-937. (Pubitemid 44402884)
9. J. Gutiérrez, A. Sedeño-Noda, M. Colebrook, J. Sicilia, An efficient approach for solving the lot-sizing problem with time-varying storage capacities, Eur J Oper Res 189 (2008), 682-693. (Pubitemid 351400544)
10. T. Liu, Economic lot sizing problem with inventory bounds, Eur J Oper Res 185 (2008), 204-215. (Pubitemid 47418460)
11. S. F. Love, Bounded replenishment and inventory models with piecewise concave costs, Manage Sci 20 (1973), 313-318.
12. M. Ãnal, W. van den Heuvel, T. Liu, A note on "Economic Lot Sizing Problem with Inventory Bounds", Technical Report EI 2011-40, Econometric Institute, Erasmus University Rotterdam, 2011.
13. Y. Pochet, L. A. Wolsey, Polyhedra for lot-sizing with Wagner-Whitin costs, Math Program 67 (1994), 297-323.
14. K. Richter, M. Sombrutzki, Remanufacturing planning for the reverse Wagner/Whitin models, Eur J Oper Res 121 (2000), 304-315. (Pubitemid 30531548)
15. F. Z. Sargut, H. E. Romeijn, Lot-sizing with non-stationary cumulative capacities, Oper Res Lett 35 (2007), 549-557. (Pubitemid 46755917)
16. 2) algorithm for the lot-sizing problem with limited inventory levels, IEEE Symposium on Emerging Technologies & Factory Automation, Paris, France 3 (1995), 78-85.
17. W. van den Heuvel, A. P. M. Wagelmans, Four equivalent lot-sizing models, Oper Res Lett 36 (2008), 465-470.
18. W. van den Heuvel, J. Gutierrez, H.-C. Hwang, A note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities," Eur J Oper Res 213 (2011), 455-457.
19. C. P. M. van Hoesel, A. P. M. Wagelmans, B. Moerman, Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions, Eur J Oper Res 75 (1994), 312-331.
20. A. P. M. Wagelmans, S. van Hoesel, A. Kolen, Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Oper Res 40 (1992), S145-S156.
21. H. M. Wagner, T. M. Whitin, Dynamic version of the economic lot-size model, Manage Sci 5 (1958), 89-96.
22. L. A. Wolsey, Lot-sizing with production and delivery time windows, Math Program Ser A 107 (2006), 471-489.
23. W. I. Zangwill, A deterministic multi-period replenishment scheduling model with backlogging, Manage Sci 13 (1966), 105-119.
24. W. I. Zangwill, Minimum concave cost flows in certain networks, Manage Sci 14 (1968), 429-450.