Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

References

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