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

Note: Dynamic lot sizing for a finite rate input process

Author

Listed:
  • Roger M. Hill

Abstract

The basic single‐product dynamic lot‐sizing problem involves determining the optimal batch production schedule to meet a deterministic, discrete‐in‐time, varying demand pattern subject to linear setup and stockholding costs. The most widely known procedure for deriving the optimal solution is the Wagner‐Whitin algorithm, although many other approaches have subsequently been developed for tackling the same problem. The objective of this note is to show how these procedures can readily be adapted when the input is a finite rate production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 221–228, 1997

Suggested Citation

  • Roger M. Hill, 1997. "Note: Dynamic lot sizing for a finite rate input process," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(2), pages 221-228, March.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:2:p:221-228
    DOI: 10.1002/(SICI)1520-6750(199703)44:23.0.CO;2-B
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199703)44:23.0.CO;2-B
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199703)44:23.0.CO;2-B?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. Kenneth R. Baker & Paul Dixon & Michael J. Magazine & Edward A. Silver, 1978. "An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints," Management Science, INFORMS, vol. 24(16), pages 1710-1720, December.
    2. 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.
    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. Beatriz Abdul-Jalbar & Roberto Dorta-Guerra & José M. Gutiérrez & Joaquín Sicilia, 2021. "Production/Inventory Policies for a Two-Echelon System with Credit Period Incentives," Mathematics, MDPI, vol. 9(15), pages 1-25, July.
    2. Suresh Chand & Sunantha Teyarachakul Prime & Suresh Sethi, 2018. "Production planning with multiple production lines: Forward algorithm and insights on process design for volume flexibility," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 535-549, September.

    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. 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.
    2. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    3. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    4. 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.
    5. 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).
    6. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    7. Li, Hongyan & Meissner, Joern, 2011. "Competition under capacitated dynamic lot-sizing with capacity acquisition," International Journal of Production Economics, Elsevier, vol. 131(2), pages 535-544, June.
    8. van Hoesel, S. & Romeijn, H.E. & Romero Morales, D. & Wagelmans, A.P.M., 2002. "Polynomial Time Algorithms For Some Multi-Level Lot-Sizing Problems With Production Capacities," ERIM Report Series Research in Management ERS-2002-59-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. 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.
    10. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    11. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    12. 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.
    13. 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.
    14. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    15. Toy, Ayhan Özgür & Berk, Emre, 2013. "Dynamic lot sizing for a warm/cold process: Heuristics and insights," International Journal of Production Economics, Elsevier, vol. 145(1), pages 53-66.
    16. 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.
    17. 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.
    18. 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.
    19. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    20. Rita Vachani, 1992. "Performance of heuristics for the uncapacitated lot‐size problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 801-813, October.

    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:44:y:1997:i:2:p:221-228. 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.