Integrated Lot Sizing in Serial Supply Chains with Production Capacities

Published Online:https://doi.org/10.1287/mnsc.1050.0378

References

  • Aggarwal A., Park J. K. Improved algorithms for economic lot-size problems. Oper. Res. (1993) 41(3):549–571LinkGoogle Scholar
  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Arntzen B. C., Brown G. G., Harrison T. P., Trafton L. L. Global supply chain management at Digital Equipment Corporation. Interfaces (1995) 25(1):69–93LinkGoogle Scholar
  • Baker K. R., Dixon P., Magazine M. J., Silver E. A. An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Sci. (1978) 24(16):1710–1720LinkGoogle Scholar
  • Bitran G. R., Yanasse H. H. Computational complexity of the capacitated lot size problem. Management Sci. (1982) 28(10):1174–1186LinkGoogle Scholar
  • Chandra P., Fisher M. L. Coordination of production and distribution planning. Eur. J. Oper. Res. (1994) 72:503–517CrossrefGoogle 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–426LinkGoogle 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). Management Sci. (1991) 37:909–925LinkGoogle Scholar
  • Florian M., Klein M. Deterministic production planning with concave costs and capacity constraints. Management Sci. (1971) 18:12–20LinkGoogle Scholar
  • Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26(7):669–679LinkGoogle Scholar
  • Geoffrion A. M., Powers R. F. Twenty years of strategic distribution system design: An evolutionary perspective. Interfaces (1995) 25(5):105–127LinkGoogle Scholar
  • Kaminsky P., Simchi-Levi D. Production and distribution lot sizing in a two stage supply chain. IIE Trans. (2003) 35(11):1065–1075CrossrefGoogle 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–747LinkGoogle Scholar
  • Thomas D. J., Griffin P. M. Coordinated supply chain management. Eur. J. Oper. Res. (1996) 94(1):1–15CrossrefGoogle Scholar
  • van den Heuvel W., Wagelmans A. P. M. A geometric algorithm to solve the NI/G/NI/ND capacitated lot-sizing problem in O(T2) time. (2003) . Technical report 2003-24, Econometric Institute Report, Rotterdam, The NetherlandsGoogle Scholar
  • van Hoesel C. P. M., Wagelmans A. P. M. An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. (1996) 42(1):142–150LinkGoogle 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–S156LinkGoogle Scholar
  • Wagner H. M. A postscript to dynamic problems of the theory of the firm. Naval Res. Logist. Quart. (1960) 7:7–12CrossrefGoogle Scholar
  • Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96LinkGoogle Scholar
  • Zangwill W. I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system—A network approach. Management Sci. (1969) 15(9):506–527LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.