On the cutting stock problem under stochastic demand

Annals of Operations Research

Volumn 179, Issue 1, 2010, Pages 169-186

  Alem Jr , Douglas José ^a   Munari Jr , Pedro Augusto ^a   Arenales, Marcos Nereu ^a   Ferreira, Paulo Augusto Valente ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Column generation; Cutting stock problems; Linear optimization; Stochastic programming

Indexed keywords

EID: 77956062454     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0454-7     Document Type: Article

References (22)

1. Avriel, M., & Williams, A. C. (1970). The value of information and stochastic programming. Operations Research, 18(5), 947-954.
2. Axsäter, S. (2006). Inventory control. Springer's international series. Berlin: Springer.
3. 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.
4. 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.
5. Birge, J. R., & Louveaux, F. V. (1997). Introduction to stochastic programming. Springer series in operations research. New York: Springer.
6. 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.
7. Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44(22), 145-159.
8. 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.
9. Foerster, H., & Wäscher, G. (2000). Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research, 38(7), 1657-1676.
10. 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.
11. Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting stock problem. Operations Research, 9, 848-859.
12. Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting stock problem-Part II. Operations Research, 11, 863-888.
13. Ignizio, J. P. (1982). Linear programming in single- and multiple-objective systems. Englewood Cliffs, New Jersey: Prentice-Hall.
14. Kall, P., & Wallace, S. W. (1994). Stochastic programming. Chichester: Wiley.
15. Krichagina, E. V., Rubio, R., Taksar, M. I., & Wein, L. (1998). A dynamic stochastic stock-cutting problem. Operations Research, 46(5), 690-701.
16. Lasdon, L. S. (1970). Optimization theory for large systems. London: MacMillan.
17. Lübbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007-1023.
18. Madansky, A. (1960). Inequalities for stochastic linear programming problems. Management Science, 6(2), 197-204.
19. 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.
20. Sculli, D. (1981). A stochastic cutting stock procedure: cutting rolls of insulating tape. Management Science, 27(8), 946-952.
21. Trkman, P., & Gradisar, M. (2007). One-dimensional cutting stock optimization in consecutive time periods. European Journal of Operational Research, 179(2), 291-301.
22. Wäscher, G., & Gau, T. (1996). Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum, 18(3), 131-144.