Skip to main content
SpringerLink
Log in

On the cutting stock problem under stochastic demand

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem’s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution—VSS—and the expected value of perfect information—EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

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

  • Avriel, M., & Williams, A. C. (1970). The value of information and stochastic programming. Operations Research, 18(5), 947–954.

    Article  Google Scholar 

  • Axsäter, S. (2006). Inventory control. Springer’s international series. Berlin: Springer.

    Google Scholar 

  • Bard, J. F., Morton, D. P., & Wang, Y. M. (2007). Workforce planning at USPS mail processing and distribution centers using stochastic optimization. Annals of Operations Research, 155(1), 51–78.

    Article  Google Scholar 

  • Belov, G., & Scheithauer, G. (2006). A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research, 171, 85–106.

    Article  Google Scholar 

  • Birge, J. R., & Louveaux, F. V. (1997). Introduction to stochastic programming. Springer series in operations research. New York: Springer.

    Google Scholar 

  • Chauhan, S. S., Martel, A., & D’Amour, S. (2008). Roll assortment optimization in a paper mill: an integer programming approach. Computers & Operations Research, 35(2), 614–627.

    Article  Google Scholar 

  • Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44(22), 145–159.

    Article  Google Scholar 

  • Escudero, L. F., Garín, A., Merino, M., & Pérez, G. (2007). The value of the stochastic solution in multistage problems. TOP, 15(1), 48–64.

    Article  Google Scholar 

  • Foerster, H., & Wäscher, G. (2000). Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research, 38(7), 1657–1676.

    Article  Google Scholar 

  • Gau, T., & Wäscher, G. (1995). CUTGEN1: a problem generator for the one-dimensional cutting stock problem. European Journal of Operational Research, 84(3), 572–579.

    Article  Google Scholar 

  • Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 848–859.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Ignizio, J. P. (1982). Linear programming in single- and multiple-objective systems. Englewood Cliffs, New Jersey: Prentice-Hall.

    Google Scholar 

  • Kall, P., & Wallace, S. W. (1994). Stochastic programming. Chichester: Wiley.

    Google Scholar 

  • Krichagina, E. V., Rubio, R., Taksar, M. I., & Wein, L. (1998). A dynamic stochastic stock-cutting problem. Operations Research, 46(5), 690–701.

    Article  Google Scholar 

  • Lasdon, L. S. (1970). Optimization theory for large systems. London: MacMillan.

    Google Scholar 

  • Lübbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007–1023.

    Article  Google Scholar 

  • Madansky, A. (1960). Inequalities for stochastic linear programming problems. Management Science, 6(2), 197–204.

    Article  Google Scholar 

  • Poldi, K. C., & Arenales, M. N. (2005). Dealing with small demand in integer cutting stock problems with limited different stock lengths. Cadernos de Computação, ICMC-USP, Série Computação, 85(6), 29–54.

    Google Scholar 

  • Sculli, D. (1981). A stochastic cutting stock procedure: cutting rolls of insulating tape. Management Science, 27(8), 946–952.

    Article  Google Scholar 

  • Trkman, P., & Gradisar, M. (2007). One-dimensional cutting stock optimization in consecutive time periods. European Journal of Operational Research, 179(2), 291–301.

    Article  Google Scholar 

  • Wäscher, G., & Gau, T. (1996). Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum, 18(3), 131–144.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematic and Statistic, University of São Paulo, CEP 13560-970, CP 668, São Carlos, SP, Brazil

    Douglas José Alem Jr., Pedro Augusto  Munari Jr. & Marcos Nereu Arenales

  2. School of Electrical and Computer Engineering, University of Campinas, Campinas, SP, Brazil

    Paulo Augusto Valente Ferreira

Authors
  1. Douglas José Alem Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Augusto  Munari Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcos Nereu Arenales
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paulo Augusto Valente Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Douglas José Alem Jr..

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alem, D.J.,  Munari, P.A., Arenales, M.N. et al. On the cutting stock problem under stochastic demand. Ann Oper Res 179, 169–186 (2010). https://doi.org/10.1007/s10479-008-0454-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-008-0454-7

Keywords

Search

Navigation