Skip to main content
SpringerLink
Log in

An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows

  • Original Article
  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T 3) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T 2, nT}) time complexity.

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

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

    Google Scholar 

  • Brahimi N., Dauzère-Pérès S., Najid N.M., Nordli A. (2006). Single item lot sizing problems. Eur. J. Oper. Res. 168:1–16

    Article  Google Scholar 

  • Federgruen A., 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. Manag. Sci. 37:909–925

    Google Scholar 

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

    Article  Google Scholar 

  • Jaruphongsa W., Çetinkaya S., Lee C.-Y. (2004a). A two-echelon inventory optimization model with demand time window considerations. J. Global Optim. 30:347–366

    Article  Google Scholar 

  • Jaruphongsa W., Çetinkaya S., Lee C.-Y. (2004b). Warehouse space capacity and delivery time window considerations in dynamic lot-sizing for a simple supply chain. Int J. Prod. Econ. 92:169–180

    Article  Google Scholar 

  • Lee C.-Y., Çetinkaya S., Wagelmans A.P.M. (2001). A dynamic lot-sizing model with demand time windows. Manag. Sci. 47:1384–1395

    Article  Google Scholar 

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

    Google Scholar 

  • Wagner H.M., Whitin T.M. (1958). Dynamic version of the economic lot size model. Manag. Sci. 5:89–96

    Article  Google Scholar 

  • Wolsey L.A. (1995). Progress with single-item lot-sizing. J. Oper. Res. 86:395–401

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Chosun University, 375 Seosuk-Dong, Dong-Gu, Gwangju, 501-759, South Korea

    Hark-Chin Hwang

Authors
  1. Hark-Chin Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hark-Chin Hwang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hwang, HC. An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows. J Glob Optim 37, 11–26 (2007). https://doi.org/10.1007/s10898-006-9033-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-006-9033-0

Keywords

Search

Navigation