IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v25y2016i12p2116-2131.html
   My bibliography  Save this article

Distributionally Robust Optimization of Two-Stage Lot-Sizing Problems

Author

Listed:
  • Yuli Zhang
  • Zuo-Jun Max Shen
  • Shiji Song

Abstract

No abstract is available for this item.

Suggested Citation

  • Yuli Zhang & Zuo-Jun Max Shen & Shiji Song, 2016. "Distributionally Robust Optimization of Two-Stage Lot-Sizing Problems," Production and Operations Management, Production and Operations Management Society, vol. 25(12), pages 2116-2131, December.
    • Handle: RePEc:bla:popmgt:v:25:y:2016:i:12:p:2116-2131
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/poms.12602
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Fernando Rojas & Víctor Leiva & Peter Wanke & Camilo Lillo & Jimena Pascual, 2019. "Modeling lot-size with time-dependent demand based on stochastic programming and case study of drug supply in Chile," PLOS ONE, Public Library of Science, vol. 14(3), pages 1-24, March.
    2. Jian Yang & Jichang Dong & Suixiang Gao & Guoqing Wang, 2023. "Blockchain-Based Long-Term Capacity Planning for Semiconductor Supply Chain Manufacturers," Sustainability, MDPI, vol. 15(6), pages 1-20, March.
    3. Wang, Changjun & Chen, Shutong, 2020. "A distributionally robust optimization for blood supply network considering disasters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    4. Liu, Kanglin & Li, Qiaofeng & Zhang, Zhi-Hai, 2019. "Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 79-101.
    5. Zhang, Yuli & Max Shen, Zuo-Jun & Song, Shiji, 2017. "Lagrangian relaxation for the reliable shortest path problem with correlated link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 501-521.
    6. Changchun Liu & Xi Xiang & Li Zheng, 2020. "A two-stage robust optimization approach for the berth allocation problem under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 425-452, June.
    7. Li, Yi & Shou, Biying, 2021. "Managing supply risk: Robust procurement strategy for capacity improvement," Omega, Elsevier, vol. 102(C).
    8. Liu, Kanglin & Zhang, Zhi-Hai, 2018. "Capacitated disassembly scheduling under stochastic yield and demand," European Journal of Operational Research, Elsevier, vol. 269(1), pages 244-257.
    9. Zhang, Yuli & Shen, Zuo-Jun Max & Song, Shiji, 2016. "Parametric search for the bi-attribute concave shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 150-168.
    10. 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.

    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:bla:popmgt:v:25:y:2016:i:12:p:2116-2131. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.