5 Conclusions and Future Research
This work revised a heuristic to determine an integer solution to one-dimensional cutting stock problems and extend it to two-dimensional problems. Real-world instances from a Brazilian metallic frameworks industry were solved. The proposed heuristic was able to improve several instances’ solution. For future research we intend to analyze more instances from the industry and also test some modifications on the heuristic proposed which were successful when applied to solve one-dimensional problems. Also, we intend to compare the proposed approach with the one by Riehme et al. 1996.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dowsland K, Dowsland W (1992) Packing problems. European Journal of Operational Research 56:2–14
Dyckhoff H, Fink U (1992) Cutting and packing in production and distribution: topology and bibliography, Springer-Verlag Co, Heidelberg
Dyckhoff H, Scheithauer G, Terno J (1977) Cutting and Packing. In: Amico M, Maffioli F, Martello S (eds) Bibliografies in combinatorial optimization. Wiley, New York
Gilmory PC, Gomory RE (1963) A linear programming approach to the cutting stock problem-Part II. Operations Research 11: 863–888
Golden B (1976) Approaches to the cutting stock problem. AIIE Transactions 8:265–274
Hinxman A (1980) The trim loss and assortment problems: a survey. European Journal of Operational Research 5:8–18
Morabito R, Arenales MN (1996) Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach. European Journal of Operational Research 94:548–560
Poldi KC, Arenales MN (2005) Dealing with small Demand in integer cutting stock problems with limites different stock lengths. Thecnical Report 85, University of Sao Paulo, Sao Paulo
Riehme J, Scheithauer G, Terno J (1996) The solution of two-stage guillotine cutting stock problems having extremelly varying order demands. European Journal of Operational Research 91:543–552
Sweeney P, Paternoster E (1992) Cutting and packing problems: a categorized application-oriented research bibliograph. Journal of the European Operational Research Society 43:691–706
Waescher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18:131–144
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poldi, K.C., Arenales, M.N., Vianna, A.C.G. (2006). Two-Dimensional Cutting Stock Problem Under Low Demand: a Study Case. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_46
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)