Abstract
One dimensional cutting stock problems arise in many manufacturing domains such as pulp and paper, textile and wood. In this paper, a new real life variant of the problem occuring in the rubber mold industry is introduced. It integrates both operational and strategical planning optimization: on one side, items need to be cut out of stocks of different lengths while minimizing trim loss, excess of production and the number of required cutting operations. Demands are however stochastic therefore the strategic choice of which mold(s) to build (i.e. which stock lengths will be available) is key for the minimization of the operational costs. A deterministic pattern-based formulation and a two-stage stochastic problem are presented. The models developed are solved with a mixed integer programming solver supported by a constraint programming procedure to generate cutting patterns. The approach shows promising experimental results on a set of realistic industrial instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
For comparison, an item-based model was also developed; it showed quickly its limitations even in relatively small instances as soon as included the over production. For brevity, we omit the item-based model and results.
- 2.
For comparison an equivalent MIP model was also developed, however it performed orders of magnitude slower for enumerating all the solutions.
- 3.
This was the case in the real industrial context examined.
References
Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44, 145–159 (1990)
Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6(4), 366–422 (1960)
Wäscher, G., Hauner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)
Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255(1), 1–20 (2016)
Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9(6), 849–859 (1961)
Belov, G., Scheithauer, G.: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171(1), 85–106 (2006)
Alem, D.J., Munari, P.A., Arenales, M.N., Ferreira, P.A.: On the cutting stock problem under stochastic demand. Ann. Oper. Res. 179(1), 169–186 (2010)
Kallrath, J., Rebennack, S., Kallrath, J., Kusche, R.: Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges. Eur. J. Oper. Res. 238(1), 374–389 (2014)
Rebennack, S., Kallrath, J., Pardalos, P.M.: Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J. Global Optim. 43(2–3), 277–297 (2009)
Beraldi, P., Bruni, M.E., Conforti, D.: The stochastic trim-loss problem. Eur. J. Oper. Res. 197(1), 42–49 (2009)
Scheithauer, G., Terno, J.: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Oper. Res. Lett. 20(2), 93–100 (1997)
Escudero, L.F., Garn, A., Merino, M., Prez, G.: The value of the stochastic solution in multistage problems. TOP 15(1), 48–64 (2007)
Acknowledgements
The author would like to thank Davide Zanarini for bringing to his attention this industrial problem.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zanarini, A. (2017). Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands. In: Salvagnin, D., Lombardi, M. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2017. Lecture Notes in Computer Science(), vol 10335. Springer, Cham. https://doi.org/10.1007/978-3-319-59776-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-59776-8_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59775-1
Online ISBN: 978-3-319-59776-8
eBook Packages: Computer ScienceComputer Science (R0)