IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v313y2024i2p513-526.html
   My bibliography  Save this article

Adaptive robust optimization for lot-sizing under yield uncertainty

Author

Listed:
  • Metzker Soares, Paula
  • Thevenin, Simon
  • Adulyasak, Yossiri
  • Dolgui, Alexandre

Abstract

In manufacturing environments, uncertain production yield directly impacts the quality and feasibility of the production planning decisions. This paper investigates the use of adaptive robust optimization to hedge against uncertain yield when determining a production plan, and to react properly when updated information unfolds. We first derive a myopic adaptive robust policy for the inventory management problem, a special case of the lot-sizing problem where the setup and the production costs are omitted. We show that the policy is optimal under mild assumptions. Second, we address a multi-period single-item lot-sizing problem with a backorder and uncertain yield via adaptive robust optimization. We formulate an adaptive robust model based on the budgeted uncertainty set, where we exploit a linear approximation to transform the quadratic constraints into a mixed-integer linear program. We also propose a column and constraint generation algorithm to solve the adaptive model exactly. Finally, we demonstrate the performances of the proposed approaches and the value of the adaptive robust solutions through extensive numerical experiments.

Suggested Citation

  • Metzker Soares, Paula & Thevenin, Simon & Adulyasak, Yossiri & Dolgui, Alexandre, 2024. "Adaptive robust optimization for lot-sizing under yield uncertainty," European Journal of Operational Research, Elsevier, vol. 313(2), pages 513-526.
  • Handle: RePEc:eee:ejores:v:313:y:2024:i:2:p:513-526
    DOI: 10.1016/j.ejor.2023.08.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723006641
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.08.036?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.

    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:eee:ejores:v:313:y:2024:i:2:p:513-526. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.