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

A stochastic programming approach to the cutting stock problem with usable leftovers

Author

Listed:
  • Cherri, Adriana Cristina
  • Cherri, Luiz Henrique
  • Oliveira, Beatriz Brito
  • Oliveira, José Fernando
  • Carravilla, Maria Antónia

Abstract

In cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experiments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method.

Suggested Citation

  • Cherri, Adriana Cristina & Cherri, Luiz Henrique & Oliveira, Beatriz Brito & Oliveira, José Fernando & Carravilla, Maria Antónia, 2023. "A stochastic programming approach to the cutting stock problem with usable leftovers," European Journal of Operational Research, Elsevier, vol. 308(1), pages 38-53.
    • Handle: RePEc:eee:ejores:v:308:y:2023:i:1:p:38-53
    DOI: 10.1016/j.ejor.2022.11.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722008682
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.11.013?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. D. Sculli, 1981. "A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape," Management Science, INFORMS, vol. 27(8), pages 946-952, August.
    2. Cui, Yaodong & Yang, Yuli, 2010. "A heuristic for the one-dimensional cutting stock problem with usable leftover," European Journal of Operational Research, Elsevier, vol. 204(2), pages 245-250, July.
    3. Douglas Alem & Pedro Munari & Marcos Arenales & Paulo Ferreira, 2010. "On the cutting stock problem under stochastic demand," Annals of Operations Research, Springer, vol. 179(1), pages 169-186, September.
    4. Santiago V. Ravelo & Cláudio N. Meneses & Maristela O. Santos, 2020. "Meta-heuristics for the one-dimensional cutting stock problem with usable leftover," Journal of Heuristics, Springer, vol. 26(4), pages 585-618, August.
    5. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki & Poldi, Kelly Cristina & Gonçalves Vianna, Andréa Carla, 2014. "The one-dimensional cutting stock problem with usable leftovers – A survey," European Journal of Operational Research, Elsevier, vol. 236(2), pages 395-402.
    6. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    7. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki, 2009. "The one-dimensional cutting stock problem with usable leftover - A heuristic approach," European Journal of Operational Research, Elsevier, vol. 196(3), pages 897-908, August.
    8. Karen Rocha Coelho & Adriana Cristina Cherri & Edméa Cassia Baptista & Charbel José Chiappetta Jabbour & Edilaine Martins Soler, 2017. "Sustainable operations: The cutting stock problem with usable leftovers from a sustainable perspective," Post-Print hal-02000703, HAL.
    9. Alexander Abuabara & Reinaldo Morabito, 2009. "Cutting optimization of structural tubes to build agricultural light aircrafts," Annals of Operations Research, Springer, vol. 169(1), pages 149-165, July.
    10. Trkman, Peter & Gradisar, Miro, 2007. "One-dimensional cutting stock optimization in consecutive time periods," European Journal of Operational Research, Elsevier, vol. 179(2), pages 291-301, June.
    11. Luka Tomat & Mirko Gradišar, 2017. "One-dimensional stock cutting: optimization of usable leftovers in consecutive orders," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 473-489, June.
    12. Beraldi, P. & Bruni, M.E. & Conforti, D., 2009. "The stochastic trim-loss problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 42-49, August.
    Full references (including those not matched with items on IDEAS)

    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. D. N. Nascimento & S. A. Araujo & A. C. Cherri, 2022. "Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers," Annals of Operations Research, Springer, vol. 316(2), pages 785-803, September.
    2. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    3. Cherri, Adriana Cristina & Arenales, Marcos Nereu & Yanasse, Horacio Hideki & Poldi, Kelly Cristina & Gonçalves Vianna, Andréa Carla, 2014. "The one-dimensional cutting stock problem with usable leftovers – A survey," European Journal of Operational Research, Elsevier, vol. 236(2), pages 395-402.
    4. Santiago V. Ravelo & Cláudio N. Meneses & Maristela O. Santos, 2020. "Meta-heuristics for the one-dimensional cutting stock problem with usable leftover," Journal of Heuristics, Springer, vol. 26(4), pages 585-618, August.
    5. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    6. Douglas Nogueira Nascimento & Adriana Cristina Cherri & José Fernando Oliveira, 2022. "The two-dimensional cutting stock problem with usable leftovers: mathematical modelling and heuristic approaches," Operational Research, Springer, vol. 22(5), pages 5363-5403, November.
    7. Luka Tomat & Mirko Gradišar, 2017. "One-dimensional stock cutting: optimization of usable leftovers in consecutive orders," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 473-489, June.
    8. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    9. Kallrath, Julia & Rebennack, Steffen & Kallrath, Josef & Kusche, Rüdiger, 2014. "Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges," European Journal of Operational Research, Elsevier, vol. 238(1), pages 374-389.
    10. Douglas Alem & Pedro Munari & Marcos Arenales & Paulo Ferreira, 2010. "On the cutting stock problem under stochastic demand," Annals of Operations Research, Springer, vol. 179(1), pages 169-186, September.
    11. Yaodong Cui & Xiang Song & Yan Chen & Yi-Ping Cui, 2017. "New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(3), pages 269-280, March.
    12. Silva, Eduardo M. & Melega, Gislaine M. & Akartunalı, Kerem & de Araujo, Silvio A., 2023. "Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost," European Journal of Operational Research, Elsevier, vol. 304(2), pages 443-460.
    13. Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
    14. Cui, Yaodong & Huang, Baixiong, 2012. "Reducing the number of cuts in generating three-staged cutting patterns," European Journal of Operational Research, Elsevier, vol. 218(2), pages 358-365.
    15. Kelly Poldi & Silvio Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.
    16. Reinertsen, Harald & Vossen, Thomas W.M., 2010. "The one-dimensional cutting stock problem with due dates," European Journal of Operational Research, Elsevier, vol. 201(3), pages 701-711, March.
    17. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
    18. Haoqing Wang & Wen Yi, 2022. "Optimization Models for Reducing Off-Cuts of Raw Materials in Construction Site," Mathematics, MDPI, vol. 10(24), pages 1-16, December.
    19. Jie Fang & Yunqing Rao & Qiang Luo & Jiatai Xu, 2023. "Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
    20. Aktin, Tülin & Özdemir, RIfat Gürcan, 2009. "An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing," European Journal of Operational Research, Elsevier, vol. 196(2), pages 737-743, July.

    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:308:y:2023:i:1:p:38-53. 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: 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.