Skip to main content
SpringerLink
Log in

Dynamic lot-sizing problem with demand time windows and container-based transportation cost

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we study the dynamic lot-sizing problem with demand time windows and container-based transportation cost. For each particular demand, there are corresponding earliest and latest times, and the duration between such earliest and latest times is the demand time window. If a demand is satisfied by a delivery within demand time window, then there is no holding or backlogging cost incurred. Our purpose is to satisfy demand at a minimum total cost, including setup cost, procurement cost, container cost, and inventory holding cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aggarwal A. and Park J.K. (1993). Improved algorithms for economic lot-size problems. Oper. Res. 41: 549–571

    MATH  MathSciNet  Google Scholar 

  2. Anily S. and Tzur M. (2005). Shipping multiple-items by capacitated vehicles—an optimal dynamic programming approach. Transp. Sci. 39: 233–248

    Article  Google Scholar 

  3. Diaby M. and Martel A. (1993). Dynamic lot sizing for multi-echelon distribution systems with purchasing and transportation price discounts. Oper. Res. 41: 48–59

    MATH  Google Scholar 

  4. Federgruen A. and Tzur M. (1991). A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(n log n) or O(n) time. Manage. Sci. 37: 909–925

    MATH  Google Scholar 

  5. Hwang H.C. and Jaruphongsa W. (2006). Dynamic lot-sizing model with demand time windows and speculative cost structure. Oper. Res. Lett. 34: 251–256

    Article  MATH  MathSciNet  Google Scholar 

  6. Jaruphongsa W., Cetinkaya S. and Lee C.-Y. (2004). A two-Echelon inventory lot-sizing problem with demand time windows. J. Glob. Optim. 30: 347–366

    Article  MATH  MathSciNet  Google Scholar 

  7. Jaruphongsa W., Cetinkaya S. and Lee C.-Y. (2005). A dynamic lot-sizing model with multi-mode replenishments: polynomial algorithms for special cased with dual and multiple modes. IIE Trans. 37: 453–467

    Article  Google Scholar 

  8. Lee C.-Y. (1989). A solution to the multiple set-up problem with dynamic demand. IIE Trans. 21: 266–270

    Article  Google Scholar 

  9. Lee C.-Y. (2004). Inventory replenishment model: lot sizing versus just-in-time delivery. Oper. Res. Lett. 32: 581–590

    Article  MATH  MathSciNet  Google Scholar 

  10. Lee C.-Y., Cetinkaya S. and Jaruphongsa W. (2003). A dynamic model for inventory lot-sizing and outbound shipment consolidation at a third party warehouse. Oper. Res. 51: 735–747

    Article  MathSciNet  Google Scholar 

  11. Lee C.-Y., Cetinkaya S. and Wagelmans A.P.M. (2001). A dynamic lot size model with demand time windows. Manage. Sci. 47: 1384–1495

    Google Scholar 

  12. Lippman S.A. (1969). Optimal inventory policy with multiple set-up costs. Manage. Sci. 16: 118–138

    MathSciNet  MATH  Google Scholar 

  13. Wagelmans A.P.M., Van Hoesel S. and Kolen A. (1992). Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner–Whitin case. Oper. Res. 40: S145–S156

    MathSciNet  Google Scholar 

  14. Wagner H.M. and Whitin T.M. (1958). Dynamic version of the economic lot-size model. Manage. Sci. 5: 89–96

    MATH  MathSciNet  Google Scholar 

  15. Wolsey L.A. (2006). Lot-sizing with production and delivery time windows. Math. Program. Ser. A 107: 471–489

    Article  MATH  MathSciNet  Google Scholar 

  16. Yano C.A. and Newman A.M. (2001). Scheduling trains and containers with due dates and dynamic arrivals. Transp. Sci. 35: 181–191

    Article  MATH  Google Scholar 

  17. Zangwill W.I. (1966). A deterministic multi-period production scheduling model with backlogging. Manage. Sci. 13: 105–119

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, National University of Singapore, Singapore, 119260, Singapore

    Wikrom Jaruphongsa

  2. Department of Industrial Engineering and Logistics Management, Hong Kong University of Science & Technology, Hong Kong, China

    Chung-Yee Lee

Authors
  1. Wikrom Jaruphongsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chung-Yee Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chung-Yee Lee.

Additional information

This research is supported in part by Hong Kong RGC grant HKUST 6010/02E and NUS ARF grant R-266-000-019-112.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaruphongsa, W., Lee, CY. Dynamic lot-sizing problem with demand time windows and container-based transportation cost. Optimization Letters 2, 39–51 (2008). https://doi.org/10.1007/s11590-006-0042-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-006-0042-1

Keywords

Search

Navigation