IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v127y2024ics0305048324000598.html
   My bibliography  Save this article

Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes

Author

Listed:
  • Li, Yuchen
  • Liu, Ming
  • Saldanha-da-Gama, Francisco
  • Yang, Zaoli

Abstract

In this paper, a comprehensive optimization problem is developed for a composite of an assembly line reconfiguration problem with multiple lines and a capacitated lot-sizing problem. Multiple products are considered, whose demand is uncertain and is dynamically forecasted. The production planner is assumed to be risk-averse, and decisions are made contingent upon the risk preference. To model the problem, a stochastic program with two stages is utilized. A solution approach is devised using a divide-and-conquer algorithm, which incorporates a set of valid inequalities. The effectiveness and efficiency of the proposed solution approach are assessed through a series of computational tests. Finally, a case study focusing on an engine production process is presented, leading to the derivation of several valuable insights.

Suggested Citation

  • Li, Yuchen & Liu, Ming & Saldanha-da-Gama, Francisco & Yang, Zaoli, 2024. "Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes," Omega, Elsevier, vol. 127(C).
    • Handle: RePEc:eee:jomega:v:127:y:2024:i:c:s0305048324000598
    DOI: 10.1016/j.omega.2024.103092
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324000598
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2024.103092?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:jomega:v:127:y:2024:i:c:s0305048324000598. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.