Skip to main content

Two-Dimensional Cutting Stock Problem Under Low Demand: a Study Case

  • Conference paper
Operations Research Proceedings 2005

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dowsland K, Dowsland W (1992) Packing problems. European Journal of Operational Research 56:2–14

    Article  MATH  Google Scholar 

  2. Dyckhoff H, Fink U (1992) Cutting and packing in production and distribution: topology and bibliography, Springer-Verlag Co, Heidelberg

    Google Scholar 

  3. 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

    Google Scholar 

  4. Gilmory PC, Gomory RE (1963) A linear programming approach to the cutting stock problem-Part II. Operations Research 11: 863–888

    Article  Google Scholar 

  5. Golden B (1976) Approaches to the cutting stock problem. AIIE Transactions 8:265–274

    MathSciNet  Google Scholar 

  6. Hinxman A (1980) The trim loss and assortment problems: a survey. European Journal of Operational Research 5:8–18

    Article  MATH  MathSciNet  Google Scholar 

  7. 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

    Article  MATH  Google Scholar 

  8. 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

    Google Scholar 

  9. 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

    Article  MATH  Google Scholar 

  10. 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

    Article  MATH  Google Scholar 

  11. Waescher G, Gau T (1996) Heuristics for the integer one-dimensional cutting stock problem: a computational study. OR Spektrum 18:131–144

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics