Economic Lot-Sizing for Integrated Production and Transportation

References

• Aggarwal A., Park J. K. Improved algorithms for economic lot-size problems. Oper. Res. (1993) 41:549–571Link, Google Scholar
• Anily S., Tzur M. Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach. Transportation Sci. (2006) 39(5):233–248Google Scholar
• Atamtürk A., Hochbaum D. S. Capacity acquisition, subcontracting, and lot sizing. Management Sci. (2001) 47:1081–1100Link, Google 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–1720Link, Google Scholar
• Bitran G. B., Yanasse H. H. Computational complexity of the capacitated lot size problem. Management Sci. (1982) 28:1174–1185Link, Google Scholar
• Çetinkaya S., Lee C.-Y. Stock replenishment and shipment scheduling for vendor managed inventory systems. Management Sci. (2000) 46:217–232Link, Google Scholar
• Çetinkaya S., Lee C.-Y. Outbound transportation: Modeling inventory and cargo capacity. Naval Res. Logist. (2002) 49:531–557Crossref, Google Scholar
• Chan L. M. A., Muriel A., Shen Z., Simchi-Levi D. On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures. Oper. Res. (2002a) 50(6):1058–1067Link, Google Scholar
• Chan L. M. A., Muriel A., Shen Z., Simchi-Levi D., Teo C. P. Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Sci. (2002b) 11:1446–1460Link, 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:420–427Link, Google 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:909–925Link, Google Scholar
• Florian M., Klein M. Deterministic replenishment planning with concave costs and capacity constraints. Management Sci. (1971) 18:12–20Link, Google Scholar
• Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic replenishment planning: Algorithms and complexity. Management Sci. (1980) 26:669–679Link, Google Scholar
• Hwang H.-C. Inventory replenishment and inbound shipment scheduling under a minimum replenishment policy. Transportation Sci. (2009) 43(2):244–264Link, Google Scholar
• Hwang H.-C., Jaruphongsa W. Dynamic lot-sizing model with demand time windows and speculative cost structure. Oper. Res. Lett. (2006) 34:251–257Crossref, Google Scholar
• Jaruphongsa W., Çetinkaya S., Lee C.-Y. A dynamic lot-sizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes. IIE Trans. (2005) 37:453–467Crossref, Google Scholar
• Kaminsky P., Simchi-Levi D. Production and distribution lot sizing in a two stage supply chain. IIE Trans. (2003) 35(11):1065–1075Crossref, Google Scholar
• Lee C.-Y. A solution to the multiple set-up problem with dynamic demand. IIE Trans. (1989) 21:266–270Crossref, Google Scholar
• Lee C.-Y. Inventory replenishment model: Lot sizing versus just-in-time delivery. Oper. Res. Lett. (2004) 32:581–590Crossref, 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:735–747Link, Google Scholar
• Lee C.-Y., Çetinkaya S., Wagelmans A. P. M. A dynamic lot-sizing model with demand time windows. Management Sci. (2001) 47:1384–1395Link, Google Scholar
• Lippman S. A. Optimal inventory policy with multiple set-up costs. Management Sci. (1969) 16:118–138Link, Google Scholar
• Love S. F. Bounded replenishment and inventory models with piecewise concave costs. Management Sci. (1973) 20:313–318Link, 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
• Sargut F. Z., Romeijn H. E. Capacitated production and subcontracting in a serial supply chain. IIE Trans. (2007) 39:1031–1043Crossref, Google 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:142–150Link, Google Scholar
• Van Hoesel C. P. M., Wagelmans A. P. M., Moerman B. Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. Eur. J. Oper. Res. (1994) 75:312–331Crossref, Google Scholar
• Van Hoesel S., Romeijn H. E., Morales D. R., Wagelmans A. P. M. Integrated lot-sizing in serial supply chains with production capacities. Management Sci. (2005) 51(11):1706–1719Link, Google Scholar
• Van Vyve M. Algorithms for single-item lot-sizing problems with constant batch size. Math. Oper. Res. (2007) 32(3):594–613Link, Google Scholar
• Wagelmans A. P. M., 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:S145–S157Link, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot-size model. Management Sci. (1958) 5:89–97Link, Google Scholar
• Wolsey L. A. Lot-sizing with production and delivery time windows. Math. Programming Ser. A (2006) 107:471–489Crossref, Google Scholar
• Zangwill W. I. A deterministic multi-period replenishment scheduling model with backlogging. Management Sci. (1966) 13:105–119Link, Google Scholar
• Zangwill W. I. A backlogging model and a multi-echelon model of a dynamic economic lot size replenishment system—A network approach. Management Sci. (1969) 15:506–527Link, Google Scholar