IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v40y1993i4p459-478.html
   My bibliography  Save this article

The dynamic lot‐sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure

Author

Listed:
  • Awi Federgruen
  • Michal Tzur

Abstract

We develop a simple O(n log n) solution method for the standard lot‐sizing model with backlogging and a study horizon of n periods. Production costs are fixed plus linear and holding and backlogging costs are linear with general time‐dependent parameters. The algorithm has linear [O(n)] time complexity for several important subclasses of the general model. We show how a slight adaptation of the algorithm can be used for the detection of a minimal forecast horizon and associated planning horizon. The adapted algorithm continues to have complexity O(n log n) or O(n) for the above‐mentioned subclasses of the general model. © 1993 John Wiley & Sons, Inc.

Suggested Citation

  • Awi Federgruen & Michal Tzur, 1993. "The dynamic lot‐sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 459-478, June.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:4:p:459-478
    DOI: 10.1002/1520-6750(199306)40:43.0.CO;2-8
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199306)40:43.0.CO;2-8
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199306)40:43.0.CO;2-8?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. Stephen C. Graves, 1982. "Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems," Management Science, INFORMS, vol. 28(3), pages 260-275, March.
    2. Suresh Chand & Suresh P. Sethi & Gerhard Sorger, 1992. "Forecast Horizons in the Discounted Dynamic Lot Size Model," Management Science, INFORMS, vol. 38(7), pages 1034-1048, July.
    3. James C. Bean & Robert L. Smith & Candace A. Yano, 1987. "Forecast horizons for the discounted dynamic lot‐size problem allowing speculative motive," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 761-774, December.
    4. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    5. Joseph D. Blackburn & Howard Kunreuther, 1974. "Planning Horizons for the Dynamic Lot Size Model with Backlogging," Management Science, INFORMS, vol. 21(3), pages 251-255, November.
    6. Alain Bensoussan & Jean‐Marie Proth & Maurice Queyranne, 1991. "A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 729-742, October.
    7. Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
    8. Gabriel R. Bitran & Hirofumi Matsuo, 1986. "The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations," Management Science, INFORMS, vol. 32(3), pages 350-359, March.
    9. 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.
    10. Suresh Chand & Suresh P. Sethi & Jean-Marie Proth, 1990. "Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models," Operations Research, INFORMS, vol. 38(5), pages 884-892, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ioannis Ganas & Sotirios Papachristos, 2005. "The Single-Product Lot-Sizing Problem with Constant Parameters and Backlogging: Exact Results, a New Solution, and All Parameter Stability Regions," Operations Research, INFORMS, vol. 53(1), pages 170-176, February.
    2. Akartunalı, Kerem & Dauzère-Pérès, Stéphane, 2022. "Dynamic lot sizing with stochastic demand timing," European Journal of Operational Research, Elsevier, vol. 302(1), pages 221-229.
    3. Yongpei Guan & Andrew J. Miller, 2008. "Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 56(5), pages 1172-1183, October.
    4. Awi Federgruen & Michal Tzur, 1996. "Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 169-189, March.

    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. Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.
    2. Archis Ghate & Robert L. Smith, 2009. "Optimal Backlogging Over an Infinite Horizon Under Time-Varying Convex Production and Inventory Costs," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 362-368, June.
    3. Awi Federgruen & Michal Tzur, 1996. "Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 169-189, March.
    4. Marshall Fisher & Kamalini Ramdas & Yu-Sheng Zheng, 2001. "Ending Inventory Valuation in Multiperiod Production Scheduling," Management Science, INFORMS, vol. 47(5), pages 679-692, May.
    5. Stanislaw Bylka, 1997. "Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(8), pages 775-790, December.
    6. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    7. Robert L. Smith & Rachel Q. Zhang, 1998. "Infinite Horizon Production Planning in Time-Varying Systems with Convex Production and Inventory Costs," Management Science, INFORMS, vol. 44(9), pages 1313-1320, September.
    8. Kimms, Alf, 1996. "Stability measures for rolling schedules with applications to capacity expansion planning, master production scheduling, and lot sizing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 418, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Hartmut Stadtler, 2000. "Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem," Management Science, INFORMS, vol. 46(2), pages 318-326, February.
    10. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    11. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    12. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    13. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, 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. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    16. Gutiérrez, J. & Sedeí±o-Noda, A. & Colebrook, M. & Sicilia, J., 2008. "An efficient approach for solving the lot-sizing problem with time-varying storage capacities," European Journal of Operational Research, Elsevier, vol. 189(3), pages 682-693, September.
    17. Bylka, S.Stanislaw & Rempala, Ryszarda, 2004. "Heuristics for impulse replenishment with continuous periodic demand," International Journal of Production Economics, Elsevier, vol. 88(2), pages 183-190, March.
    18. Kian, Ramez & Gürler, Ülkü & Berk, Emre, 2014. "The dynamic lot-sizing problem with convex economic production costs and setups," International Journal of Production Economics, Elsevier, vol. 155(C), pages 361-379.
    19. 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.
    20. Lee, C.Y. & Cetinkaya, S. & Wagelmans, A.P.M., 1999. "A dynamic lot-sizing model with demand time windows," Econometric Institute Research Papers EI 9948-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:40:y:1993:i:4:p:459-478. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.