IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-7639-9_2.html
   My bibliography  Save this book chapter

Multi-Period Lot-Sizing with Stationary Demand: Extension to Forecast Horizons

In: Handbook of EOQ Inventory Problems

Author

Listed:
  • Suresh Chand

    (Purdue University)

  • Suresh Sethi

    (The University of Texas at Dallas)

Abstract

This chapter considers the multi-period lot-sizing problem with stationary demands in the initial few periods and possibly dynamic demands in the subsequent periods. Both the average cost and the discounted cost problems are considered. Also, both finite and infinite-horizon problems are considered. The results presented in this chapter include properties of optimal solutions for these problems, efficient algorithms for solving these, and the forecast horizon property. Most of the results in the chapter are based on the research done by the authors of this chapter and their co-authors over the past three decades. An attempt has been made to make the review in the chapter largely complete and self contained and proofs have been simplified where possible.

Suggested Citation

  • Suresh Chand & Suresh Sethi, 2014. "Multi-Period Lot-Sizing with Stationary Demand: Extension to Forecast Horizons," International Series in Operations Research & Management Science, in: Tsan-Ming Choi (ed.), Handbook of EOQ Inventory Problems, edition 127, pages 23-42, Springer.
    • Handle: RePEc:spr:isochp:978-1-4614-7639-9_2
    DOI: 10.1007/978-1-4614-7639-9_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fabian Dunke & Stefan Nickel, 2021. "Online optimization with gradual look-ahead," Operational Research, Springer, vol. 21(4), pages 2489-2523, December.
    2. Yongjian Li & Xiaoqiang Cai & Lei Xu & Wenxia Yang, 2016. "Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints," Annals of Operations Research, Springer, vol. 242(2), pages 265-283, July.

    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:spr:isochp:978-1-4614-7639-9_2. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.