IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i20p6691-6717.html
   My bibliography  Save this article

The integrated lot-sizing and cutting stock problem under demand uncertainty

Author

Listed:
  • Eduardo Curcio
  • Vinícius L. de Lima
  • Flávio K. Miyazawa
  • Elsa Silva
  • Pedro Amorim

Abstract

Interest in integrating lot-sizing and cutting stock problems has been increasing over the years. This integrated problem has been applied in many industries, such as paper, textile and furniture. Yet, there are only a few studies that acknowledge the importance of uncertainty to optimise these integrated decisions. This work aims to address this gap by incorporating demand uncertainty through stochastic programming and robust optimisation approaches. Both robust and stochastic models were specifically conceived to be solved by a column generation method. In addition, both models are embedded in a rolling-horizon procedure in order to incorporate dynamic reaction to demand realisation and adapt the models to a multistage stochastic setting. Computational experiments are proposed to test the efficiency of the column generation method and include a Monte Carlo simulation to assess both stochastic programming and robust optimisation for the integrated problem. Results suggest that acknowledging uncertainty can cut costs by up to 39.7%, while maintaining or reducing variability at the same time.

Suggested Citation

  • Eduardo Curcio & Vinícius L. de Lima & Flávio K. Miyazawa & Elsa Silva & Pedro Amorim, 2023. "The integrated lot-sizing and cutting stock problem under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 61(20), pages 6691-6717, October.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:20:p:6691-6717
    DOI: 10.1080/00207543.2022.2136279
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2136279
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2136279?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.

    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:taf:tprsxx:v:61:y:2023:i:20:p:6691-6717. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.