Algorithms for single-item lot-sizing problems with constant batch size

Mathematics of Operations Research

Volumn 32, Issue 3, 2007, Pages 594-613

  Van Vyve, Mathieu ^a  

^a N SIDE SA   (Belgium)

Author keywords

Capacitated lot sizing; Complexity

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

CAPACITATED LOT-SIZING; INSTALLABLE BATCHES;

OPERATIONS RESEARCH;

EID: 38549132496     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0257     Document Type: Article

References (30)

1. Aggarwal, A., J. K. Park. 1990. Improved algorithms for economic lot size problems. Oper. Res. 41(3) 549-571.
2. Ahuja, R. K., Magnanti, T. L., J. B. Orlin. 1993. Network Flows. Prentice Hall, Inc., Englewood Cliffs, NJ.
3. Alp, O., N. Erkip, R. Gullu. 2003. Optimal lot sizing/vehicle dispatching policies under stochastic lead times and stepwise fixed costs. Oper. Res. 51(1) 160-171.
4. Bitran, G., H. Yanasse. 1982. Computational complexity of the capacitated lot size problem. Management Sci. 28(10) 1174-1185.
5. Chan, L. M. A., A. Muriel, Z.-J. Shen, D. Simchi-Levi. 2003. On the effectiveness of zero-inventory ordering policies for the economic lot-sizing models with a class of piecewise linear cost structures. Oper. Res. 51(1) 160-171.
6. 2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Sci. 34(3) 420-426.
7. Cormen, T. H., C. E. Leiserson, R. L. Rivest. 2002. Introduction to Algorithms. MIT Electrical and Computer Science Series. MIT Press, Cambridge, MA.
8. Federgruen, A., M. Tzur. 1991. A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Management Sci. 37(8) 909-925.
9. Fleischmann, B. 1990. The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44(3) 337-348.
10. Fleischmann, B. 1994. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 75(2) 395-404.
11. Florian, M., M. Klein. 1971. Deterministic production planning with concave costs and capacity constraints. Management Sci. 18(11) 12-20.
12. Florian, M., J. K. Lenstra, A. H. G. Rinnooy Kan. 1980. Deterministic production planning: Algorithms and complexity. Management Sci. 26(7) 669-679.
13. Lasdon, L. S., R. C. Terjung. 1971. An efficient algorithm for multi-item scheduling. Oper. Res. 19(4) 946-969.
14. Lee, C.-Y. 1989. A solution to the multiple set-up problem with dynamic demand. IEE Trans. 21(3) 266-270.
15. Lee, C.-Y., S. Çetinkaya, W. Jaruphongsa. 2003. A dynamic model for inventory lot-sizing and outbound shipment scheduling at a third party warehouse. Oper. Res. 51(5) 735-747.
16. Lippman, S. A. 1969. Optimal inventory policy with multiple set-up costs. Management Sci. 16(1) 118-138.
17. Miller, A. J., L. Wolsey. 2003. Tight MIP formulations for multi-item discrete lot-sizing problems. Oper. Res. 51(4) 557-565.
18. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Chichester, UK.
19. Pochet, Y., L. A. Wolsey. 1993. Lot-sizing with constant batches: Formulations and valid inequalities. Math. Oper. Res. 18(4) 767-785.
20. van Eijl, C. A. 1996. A polyhedral approach to the discrete lot-sizing and scheduling problem. Ph.D. thesis, Technische Universiteit Eindhoven.
21. van Eijl, C. A., C. P. M. van Hoesel. 1997. On the discrete lot-sizing and scheduling problem. Oper. Res. Lett. 20(7) 7-13.
22. 3) algorithm for the economic lotsizing problem with constant capacities. Management Sci. 42(1) 142-150.
23. van Hoesel, C. P. M., A. Wagelmans. 2001. Fully polynomial approximation schemes for the single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26(2) 339-357.
24. van Hoesel, C. P. M., R. Kuik, M. Salomon, L. N. van Wassenhove. 1994. The discrete lot-sizing and scheduling problem. Discrete Appl. Math. 48(3) 289-303.
25. van Hoesel, S., A. Wagelmans, B. Moerman. 1994. Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. Eur. J. Oper. Res. 75(2) 312-331.
26. Van Vyve, M. 2005. The continuous mixing polyhedron. Math. Oper. Res. 30(2) 441-452.
27. Van Vyve, M. 2006. Linear programming extended formulations for the single-item lot-sizing problem with back-logging and constant capacity. Math. Programming 108(1) 53-77.
28. Wagelmans, A., S. van Hoesel, A. Kolen. 1992. Economic lot-sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40(1) S145-S156.
29. Wagner, H. M., T. M. Whitin. 1958. Dynamic version of the economic lot size model. Management Sci. 5(1) 89-96.
30. Zangwill, W. I. 1968. Minimum concave cost flows in certain networks. Management Sci. 14(7) 429-450.