Skip to main content
SpringerLink
Log in

Roll Cutting in the Curtain Industry

(Extended Abstract)

  • Conference paper
Algorithms – ESA 2005 (ESA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3669))

Included in the following conference series:

  • 2196 Accesses

Abstract

We study the problem of cutting a number of pieces of the same length from n rolls of different lengths so that the remaining part of each utilized roll is either sufficiently short or sufficiently long. A piece is sufficiently short, if it is shorter than a pre-specified threshold value δ min, so that it can be thrown away as it cannot be used again for cutting future orders. And a piece is sufficiently long, if it is longer than a pre-specified threshold value δ max (with δ max > δ min), so that it can reasonably be expected to be usable for cutting future orders of almost any length. We show that this problem, faced by a curtaining wholesaler, is solvable in O(n log n) time by analyzing a non-trivial class of allocation problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences 7, 448–461 (1972)

    Article  MathSciNet  Google Scholar 

  2. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Part II. Operations Research 11, 863–888 (1961)

    Article  MathSciNet  Google Scholar 

  6. Gradišar, M., Jesenko, J., Resinovič, G.: Optimization of roll cutting in clothing industry. Computers and Operations Research 24(10), 945–953 (1997)

    Article  MATH  Google Scholar 

  7. Gradišar, M., Kljajić, M., Resinovič, G., Jesenko, J.: A sequential heuristic procedure for one-dimensional cutting. European Journal of Operational Research 114(3), 557–568 (1999)

    Article  MATH  Google Scholar 

  8. Ibaraki, T., Katoh, N.: Resource allocation problems: Algorithmic approaches. MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  9. Wang, P.Y., Wäscher, G.: Editorial – cutting and packing. European Journal of Operational Research 141(2), 239–240 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento dei Sistemi di Produzione ed Economia dell’Azienda, Polytechnic University of Torino, Torino, Italy

    Arianna Alfieri

  2. Rotterdam School of Management, Erasmus University, Rotterdam, The Netherlands

    Steef L. van de Velde

  3. Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands

    Gerhard J. Woeginger

Authors
  1. Arianna Alfieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steef L. van de Velde
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerhard J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark

    Gerth Stølting Brodal

  2. University of Rome “La Sapienza”, Rome, Italy

    Stefano Leonardi

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alfieri, A., van de Velde, S.L., Woeginger, G.J. (2005). Roll Cutting in the Curtain Industry. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_27

Download citation

  • DOI: https://doi.org/10.1007/11561071_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29118-3

  • Online ISBN: 978-3-540-31951-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation