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

Strong turnpike policies in the single‐item capacitated lot‐sizing problem with periodical dynamic parameter

Author

Listed:
  • Stanislaw Bylka

Abstract

This article considers optimization problems in a discrete capacitated lot sizing model for a single product with limited backlogging. The demand as well as the holding and backlogging costs are assumed to be periodical in time. Nothing is assumed about types of the cost functions. It is shown that there exists an optimal infinite inverse policy and a strong turnpike policy. A forward algorithm for computing optimal policies relative to the class of batch ordering type policies is derived. Some backward procedure is adopted to determine a strong turnpike policy. The algorithm is simple, and it terminates after the a number of steps equal to the turnpike horizon. Some remarks on the existence of rolling horizontal plans and forecast horizons are also given. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 775–790, 1997

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:44:y:1997:i:8:p:775-790
    DOI: 10.1002/(SICI)1520-6750(199712)44:83.0.CO;2-7
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199712)44:83.0.CO;2-7
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199712)44:83.0.CO;2-7?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. Banerjee, Avijit & Burton, Jonathan S., 1994. "Coordinated vs. independent inventory replenishment policies for a vendor and multiple buyers," International Journal of Production Economics, Elsevier, vol. 35(1-3), pages 215-222, June.
    2. Suresh Chand & Thomas E. Morton, 1986. "Minimal forecast horizon procedures for dynamic lot size models," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(1), pages 111-122, February.
    3. Yu‐Sheng Zheng & Fangruo Chen, 1992. "Inventory policies with quantized ordering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 285-305, April.
    4. Pochet, Y. & Wolsey, L. A., 1995. "Algorithms and reformulations for lot sizing problems," LIDAM Reprints CORE 1160, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Richard A. Sandbothe & Gerald L. Thompson, 1990. "A Forward Algorithm for the Capacitated Lot Size Model with Stockouts," Operations Research, INFORMS, vol. 38(3), pages 474-486, June.
    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. 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.
    8. 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)

    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. 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.
    3. 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.
    4. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.
    5. 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.
    6. Michael Bastian, 1992. "A perfect lot‐tree procedure for the discounted dynamic lot‐size problem with speculation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 651-668, August.
    7. Bylka, Stanislaw, 2005. "Turnpike policies for periodic review inventory model with emergency orders," International Journal of Production Economics, Elsevier, vol. 93(1), pages 357-373, January.
    8. Fuying Jing & Zirui Lan, 2017. "Forecast horizon of multi-item dynamic lot size model with perishable inventory," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-15, November.
    9. 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.
    10. Berk, Emre & Toy, Ayhan Ozgur & Hazir, Oncu, 2008. "Single item lot-sizing problem for a warm/cold process with immediate lost sales," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1251-1267, June.
    11. 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.
    12. Bylka, StanisLaw, 2011. "Non-cooperative strategies for production and shipment lot sizing in one vendor-multi-buyer system," International Journal of Production Economics, Elsevier, vol. 131(1), pages 372-382, May.
    13. Jiafu Tang & Kai-Leung Yung & Iko Kaku & Jianbo Yang, 2008. "The scheduling of deliveries in a production-distribution system with multiple buyers," Annals of Operations Research, Springer, vol. 161(1), pages 5-23, July.
    14. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    15. Bylka, Stanislaw, 1999. "A dynamic model for the single-vendor, multi-buyer problem," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 297-304, March.
    16. Jing, Fuying & Chao, Xiangrui, 2021. "A dynamic lot size model with perishable inventory and stockout," Omega, Elsevier, vol. 103(C).
    17. Cigdem Gurgur, 2013. "Optimal configuration of a decentralized, market-driven production/inventory system," Annals of Operations Research, Springer, vol. 209(1), pages 139-157, October.
    18. van Hoesel, C.P.M. & Wagelmans, A., 1997. "Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems," Research Memorandum 029, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    19. Chan, Chi Kin & Fang, Fei & Langevin, André, 2018. "Single-vendor multi-buyer supply chain coordination with stochastic demand," International Journal of Production Economics, Elsevier, vol. 206(C), pages 110-133.
    20. Yves Pochet & Mathieu Van Vyve, 2004. "A General Heuristic for Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 316-327, August.

    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:8:p:775-790. 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.