Skip to main content
SpringerLink
Log in

Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers

  • S.I.: CLAIO 2018
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper addresses the integration of the lot-sizing problem and the one-dimensional cutting stock problem with usable leftovers (LSP-CSPUL). This integration aims to minimize the cost of cutting items from objects available in stock, allowing the bringing forward production of items that have known demands in a future planning horizon. The generation of leftovers, that will be used to cut future items, is also allowed and these leftovers are not considered waste in the current period. Inventory costs for items and leftovers are also considered. A mathematical model for the LSP-CSPUL is proposed to represent this problem and an approach, using the simplex method with column generation, is proposed to solve the linear relaxation of this model. A heuristic procedure, based on a relax-and-fix strategy, was also proposed to find integer solutions. Computational tests were performed and the results show the contributions of the proposed mathematical model, as well as, the quality of the solutions obtained using the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abuabara, A., & Morabito, R. (2009). Cutting optimization of structural tubes to build agricultural light aircrafts. Annals of Operations Research, 149(1), 149–165.

    Article  Google Scholar 

  • Arenales, M. N., Cherri, A. C., & do Nascimento, D. N., & Vianna, A. C. G., (2015). A new mathematical model for the cutting stock/leftover problem. Pesquisa Operacional, 35(3), 1–14.

  • Birgin, E. G., Romão, O. C., & Ronconi, D. P. (2020). The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers. International Transactions in Operational Research, 27(3), 1392–1418.

    Article  Google Scholar 

  • Brown, A. R. (1971). Optimum packing and depletion, the computer in space and resource usage problem. New York: Macdonald - London & American Elsevier Inc.

    Google Scholar 

  • Campello, B. S. C., Ghidini, C. T. L. S., Ayres, A. O. C., & Oliveira, W. A. (2019). A multiobjective integrated model for lot-sizing and cutting stock problems. Journal of the Operational Research Society, 1–13.

  • Cherri, A. C., Arenales, M. N., & Yanasse, H. H. (2009). The one-dimensional cutting stock problem with usable leftover—A heuristic approach. European Journal of Operational Research, 196(3), 897–908.

    Article  Google Scholar 

  • Cherri, A. C., Alem, D. J., & Silva, I. N. (2011). Inferência Fuzzy para o problema de corte de estoque com sobras aproveitáveis de material. Pesquisa Operacional, 31, 1–22.

    Article  Google Scholar 

  • Cherri, A. C., Arenales, M. N., & Yanasse, H. H. (2014). The one-dimensional cutting stock problem with usable leftovers—A survey. European Journal of Operational Research, 236(2), 395–402.

    Article  Google Scholar 

  • Coelho, K. R., Cherri, A. C., Baptista, E. C., Jabbour, C. J. C., & Soler, E. M. (2017). Sustainable operations: The cutting stock problem with usable leftovers from a sustainable perspective. Journal of Cleaner Production, 167, 545–552.

    Article  Google Scholar 

  • Cui, Y., & Yang, Y. (2010). A heuristic for the one-dimensional cutting stock problem with usable leftover. European Journal of Operational Research, 204(2), 245–250.

    Article  Google Scholar 

  • Erjavec, J., Gradisar, M., & Trkman, P. (2012). Assessment of stock size to minimize cutting stock production costs. International Journal of Production Economics, 135(1), 170–176.

    Article  Google Scholar 

  • Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting stock problem—Part II. Operations Research, 11(6), 863–888.

    Article  Google Scholar 

  • Gradisar, M., Jesenko, J., & Resinovic, C. (1997). Optimization of roll cutting in clothing industry. Computers & Operational Research, 24(10), 945–953.

    Article  Google Scholar 

  • Leao, A. A. S., Furlan, M. M., & Toledo, F. M. B. (2017). Decomposition methods for the lot-sizing and cutting-stock problems in paper industries. Applied Mathematical Modelling, 48, 250–268.

    Article  Google Scholar 

  • Lemos, F. K., Cherri, A. C., & de Araujo, S. A. (2020). The cutting stock problem with multiple manufacturing modes applied to a construction industry. International Journal of Production Research,. https://doi.org/10.1080/00207543.2020.1720923.

    Article  Google Scholar 

  • Melega, G. M., de Araujo, S. A., & Jans, R. (2018). Classification and literature review of integrated lot-sizing and cutting stock problems. European Journal of Operational Research, 271(1), 1–19.

    Article  Google Scholar 

  • Poldi, K. C., & de Araujo, S. A. (2016). Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem. Annals of Operations Research, 238, 497–520.

    Article  Google Scholar 

  • Poltroniere, S. C., Poldi, K. C., Toledo, F. M. B., & Arenales, M. N. (2008). A coupling cutting stock-lot-sizing problem in the paper industry. Annals of Operations Research, 157, 91–104.

    Article  Google Scholar 

  • Scheithauer, G. (1991). A note on handling residual length. Optimization, 22(3), 461–466.

    Article  Google Scholar 

  • Tomat, L., & Gradisar, M. (2017). One-dimensional stock cutting, optimization of usable leftovers in consecutive orders. Central European Journal of Operations Research, 25(2), 473–489.

    Article  Google Scholar 

  • Wolsey, L. A. (1998). Integer programming. Wiley-Interscience series in discrete mathematics and optimization. New Jersey: Wiley.

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank the editor and anonymous reviewers for their careful reading and useful comments. This research was funded by the Conselho Nacional de Desenvolvimento Científico e Tecnológico - CNPq (Grant numbers 421130/2018-0, 305261/2018-5, 306558/2018-1 and 406335/2018-4) and Fundação de Amparo a Pesquisa do Estado de São Paulo - FAPESP (Grant numbers 2013/07375-0, 2016/01860-1 and 2018/16600-0).

Author information

Authors and Affiliations

  1. Departamento de Engenharia de Produção, FEB, UNESP, Bauru, SP, Brazil

    D. N. do Nascimento

  2. Departamento de Matemática, IBILCE, UNESP, São José do Rio Preto, SP, Brazil

    S. A. de Araujo

  3. Departamento de Matemática, FC, UNESP, Bauru, SP, Brazil

    A. C. Cherri

Authors
  1. D. N. do Nascimento
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. A. de Araujo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. C. Cherri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. C. Cherri.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

do Nascimento, D.N., de Araujo, S.A. & Cherri, A.C. Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers. Ann Oper Res 316, 785–803 (2022). https://doi.org/10.1007/s10479-020-03772-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-020-03772-9

Keywords

Search

Navigation