IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v65y2016i4d10.1007_s10898-015-0392-2.html
   My bibliography  Save this article

Algorithms for the two-stage production-capacitated lot-sizing problem

Author

Listed:
  • Hark-Chin Hwang

    (Kyung Hee University)

  • Hyun-Soo Ahn

    (University of Michigan)

  • Philip Kaminsky

    (University of California)

Abstract

We model the two-stage production-capacitated lot-sizing problem as a concave minimum cost network flow problem and characterize the possible patterns of flow between successive periods in which transportation occurs. We demonstrate that production and transportation decisions can be made based only on the local state of transportation patterns between successive transportation periods. Utilizing this observation together with the insight that it is not necessary to consider transportation decisions between transportation periods, we provide a novel improved $$O(T^6)$$ O ( T 6 ) algorithm (where T is the length of the planning horizon). We extend this approach to special cases, and develop an $$O(T^5)$$ O ( T 5 ) algorithm for the case with non-speculative costs, and an $$O(T^4)$$ O ( T 4 ) algorithm for the case with linear costs.

Suggested Citation

  • Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2016. "Algorithms for the two-stage production-capacitated lot-sizing problem," Journal of Global Optimization, Springer, vol. 65(4), pages 777-799, August.
    • Handle: RePEc:spr:jglopt:v:65:y:2016:i:4:d:10.1007_s10898-015-0392-2
    DOI: 10.1007/s10898-015-0392-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-015-0392-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-015-0392-2?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    2. 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.
    3. VAN VYVE, Mathieu & WOLSEY, Laurence A & YAMAN, Hande, 2014. "Relaxations for two-level multi-item lot-sizing problems," LIDAM Reprints CORE 2611, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    5. 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.
    6. MELO, Rafael A. & WOLSEY, Laurence A., 2010. "Uncapacitated two-level lot-sizing," LIDAM Reprints CORE 2235, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).
    2. Rowshannahad, Mehdi & Absi, Nabil & Dauzère-Pérès, Stéphane & Cassini, Bernard, 2018. "Multi-item bi-level supply chain planning with multiple remanufacturing of reusable by-products," International Journal of Production Economics, Elsevier, vol. 198(C), pages 25-37.
    3. Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).

    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. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    2. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    3. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).
    4. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    5. Ventura, José A. & Valdebenito, Victor A. & Golany, Boaz, 2013. "A dynamic inventory model with supplier selection in a serial supply chain structure," European Journal of Operational Research, Elsevier, vol. 230(2), pages 258-271.
    6. 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.
    7. Hark-Chin Hwang & Wilco van den Heuvel & Albert P. M. Wagelmans, 2023. "Multilevel Lot-Sizing with Inventory Bounds," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1470-1490, November.
    8. 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.
    9. Bunn, Kevin A. & Ventura, José A., 2023. "A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs," European Journal of Operational Research, Elsevier, vol. 307(1), pages 116-129.
    10. Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer, 2017. "Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 854-875, August.
    11. Hadi Farhangi, 2021. "Multi-Echelon Supply Chains with Lead Times and Uncertain Demands," SN Operations Research Forum, Springer, vol. 2(3), pages 1-25, September.
    12. Wu, Kan & Yuan, Xue-Ming, 2016. "Optimal production-inventory policy for an integrated multi-stage supply chain with time-varying demandAuthor-Name: Zhao, Shi Tao," European Journal of Operational Research, Elsevier, vol. 255(2), pages 364-379.
    13. Minjiao Zhang & Simge Küçükyavuz & Hande Yaman, 2012. "A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands," Operations Research, INFORMS, vol. 60(4), pages 918-935, August.
    14. VAN VYVE, Mathieu & WOLSEY, Laurence & YAMAN, Hande, 2012. "Relaxations for two-level multi-item lot-sizing problem," LIDAM Discussion Papers CORE 2012031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. 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.
    16. 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.
    17. Pan, Zhendong & Tang, Jiafu & Liu, Ou, 2009. "Capacitated dynamic lot sizing problems in closed-loop supply chain," European Journal of Operational Research, Elsevier, vol. 198(3), pages 810-821, November.
    18. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    19. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    20. 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.

    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:jglopt:v:65:y:2016:i:4:d:10.1007_s10898-015-0392-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.

    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: 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.