IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v51y2003i5p735-747.html
   My bibliography  Save this article

A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse

Author

Listed:
  • Chung-Yee Lee

    (Department of Industrial Engineering & Engineering Management, The Hong Kong University of Science and Technology, Hong Kong)

  • Sila Çetinkaya

    (Department of Industrial Engineering, Texas A&M University, College Station, Texas 77843-3131)

  • Wikrom Jaruphongsa

    (Department of Industrial and Systems Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Republic of Singapore)

Abstract

This paper presents a model for computing the parameters of an integrated inventory replenishment and outbound dispatch scheduling policy under dynamic demand considerations. The optimal policy parameters specify (i) how often and in what quantities to replenish the stock at an upstream supply chain member (e.g., a warehouse), and (ii) how often to release an outbound shipment to a downstream supply-chain member (e.g., a distribution center). The problem is represented using a two-echelon dynamic lot-sizing model with pre-shipping and late-shipping considerations, where outbound cargo capacity constraints are considered via a stepwise cargo cost function. Although the paper is motivated by a third-party warehousing application, the underlying model is applicable in the general context of coordinating inventory and outbound transportation decisions. The problem is challenging due to the stepwise cargo cost structure modeled. The paper presents several structural properties of the problem and develops a polynomial time algorithm for computing the optimal solution.

Suggested Citation

  • Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    • Handle: RePEc:inm:oropre:v:51:y:2003:i:5:p:735-747
    DOI: 10.1287/opre.51.5.735.16752
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.51.5.735.16752
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.51.5.735.16752?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Hau L. Lee & Kut C. So & Christopher S. Tang, 2000. "The Value of Information Sharing in a Two-Level Supply Chain," Management Science, INFORMS, vol. 46(5), pages 626-643, May.
    2. Sila Çetinkaya & Chung-Yee Lee, 2000. "Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems," Management Science, INFORMS, vol. 46(2), pages 217-232, February.
    3. Willard I. Zangwill, 1969. "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System--A Network Approach," Management Science, INFORMS, vol. 15(9), pages 506-527, May.
    4. Daganzo, Carlos F., 1988. "Shipment composition enhancement at a consolidation center," Transportation Research Part B: Methodological, Elsevier, vol. 22(2), pages 103-124, April.
    5. Osman Alp & Nesim K. Erkip & Refik Güllü, 2003. "Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs," Operations Research, INFORMS, vol. 51(1), pages 160-166, February.
    6. Hahm, Juho & Yano, Candace Arai, 1992. "The economic lot and delivery scheduling problem: The single item case," International Journal of Production Economics, Elsevier, vol. 28(2), pages 235-252, November.
    7. Warren B. Powell, 1985. "Analysis of Vehicle Holding and Cancellation Strategies in Bulk Arrival, Bulk Service Queues," Transportation Science, INFORMS, vol. 19(4), pages 352-377, November.
    8. Bruce C. Arntzen & Gerald G. Brown & Terry P. Harrison & Linda L. Trafton, 1995. "Global Supply Chain Management at Digital Equipment Corporation," Interfaces, INFORMS, vol. 25(1), pages 69-93, February.
    9. Van Eijs, M. J. G., 1994. "Multi-item inventory systems with joint ordering and transportation decisions," International Journal of Production Economics, Elsevier, vol. 35(1-3), pages 285-292, June.
    10. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    11. Juho Hahm & Candace Arai Yano, 1995. "The Economic Lot and Delivery Scheduling Problem: Powers of Two Policies," Transportation Science, INFORMS, vol. 29(3), pages 222-241, August.
    12. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    13. Douglas A. Popken, 1994. "An Algorithm for the Multiattribute, Multicommodity Flow Problem with Freight Consolidation and Inventory Costs," Operations Research, INFORMS, vol. 42(2), pages 274-286, April.
    14. Candace A. Yano & Alexandra M. Newman, 2001. "Scheduling Trains and Containers with Due Dates and Dynamic Arrivals," Transportation Science, INFORMS, vol. 35(2), pages 181-191, May.
    15. Lawrence D. Burns & Randolph W. Hall & Dennis E. Blumenfeld & Carlos F. Daganzo, 1985. "Distribution Strategies that Minimize Transportation and Inventory Costs," Operations Research, INFORMS, vol. 33(3), pages 469-490, June.
    16. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    17. Gabriel R. Bitran & Thomas L. Magnanti & Horacio H. Yanasse, 1984. "Approximation Methods for the Uncapacitated Dynamic Lot Size Problem," Management Science, INFORMS, vol. 30(9), pages 1121-1140, September.
    18. Chung-Yee Lee & Eric V. Denardo, 1986. "Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model," Mathematics of Operations Research, INFORMS, vol. 11(3), pages 423-432, August.
    19. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sıla Çetinkaya & Chung‐Yee Lee, 2002. "Optimal outbound dispatch policies: Modeling inventory and cargo capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(6), pages 531-556, September.
    2. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    3. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
    4. Chung-Yee Lee & Sila Çetinkaya & Albert P. M. Wagelmans, 2001. "A Dynamic Lot-Sizing Model with Demand Time Windows," Management Science, INFORMS, vol. 47(10), pages 1384-1395, October.
    5. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    6. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    7. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.
    8. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
    9. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    10. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    11. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P.M. Wagelmans, 2002. "Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities," Tinbergen Institute Discussion Papers 02-066/4, Tinbergen Institute.
    12. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    13. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    14. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    15. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    16. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    17. van Hoesel, C.P.M. & Romeijn, H.E. & Romero Morales, M.D. & Wagelmans, A., 2002. "Polynomial time algorithms for some multi-level lot-sizing problems with production capacities," Research Memorandum 018, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    18. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    19. van den Heuvel, W., 2004. "On the complexity of the economic lot-sizing problem with remanufacturing options," Econometric Institute Research Papers EI 2004-46, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Jian Yang & Xiangtong Qi & Gang Yu, 2005. "Disruption management in production planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 420-442, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:51:y:2003:i:5:p:735-747. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.