Integrated Lot Sizing in Serial Supply Chains with Production Capacities
Published Online:1 Nov 2005https://doi.org/10.1287/mnsc.1050.0378
References
- Improved algorithms for economic lot-size problems. Oper. Res. (1993) 41(3):549–571Link, Google Scholar
- Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
- Global supply chain management at Digital Equipment Corporation. Interfaces (1995) 25(1):69–93Link, Google Scholar
- An algorithm for the dynamic lot-size problem with time-varying production capacity constraints. Management Sci. (1978) 24(16):1710–1720Link, Google Scholar
- Computational complexity of the capacitated lot size problem. Management Sci. (1982) 28(10):1174–1186Link, Google Scholar
- Coordination of production and distribution planning. Eur. J. Oper. Res. (1994) 72:503–517Crossref, Google Scholar
- An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Sci. (1988) 34(3):420–426Link, Google Scholar
- 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–925Link, Google Scholar
- Deterministic production planning with concave costs and capacity constraints. Management Sci. (1971) 18:12–20Link, Google Scholar
- Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26(7):669–679Link, Google Scholar
- Twenty years of strategic distribution system design: An evolutionary perspective. Interfaces (1995) 25(5):105–127Link, Google Scholar
- Production and distribution lot sizing in a two stage supply chain. IIE Trans. (2003) 35(11):1065–1075Crossref, Google Scholar
- 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
- Coordinated supply chain management. Eur. J. Oper. Res. (1996) 94(1):1–15Crossref, Google Scholar
- 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
- An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. (1996) 42(1):142–150Link, Google Scholar
- 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
- A postscript to dynamic problems of the theory of the firm. Naval Res. Logist. Quart. (1960) 7:7–12Crossref, Google Scholar
- Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96Link, Google Scholar
- 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–527Link, Google Scholar

