Advertisement

Roll Cutting in the Curtain Industry

(Extended Abstract)
  • Arianna Alfieri
  • Steef L. van de Velde
  • Gerhard J. Woeginger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)

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.

Keywords

Allocation Problem Customer Order Binary Search Tree Preprocessing Phase Core Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)zbMATHGoogle Scholar
  4. 4.
    Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Part II. Operations Research 11, 863–888 (1961)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Gradišar, M., Jesenko, J., Resinovič, G.: Optimization of roll cutting in clothing industry. Computers and Operations Research 24(10), 945–953 (1997)zbMATHCrossRefGoogle Scholar
  7. 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)zbMATHCrossRefGoogle Scholar
  8. 8.
    Ibaraki, T., Katoh, N.: Resource allocation problems: Algorithmic approaches. MIT Press, Cambridge (1988)zbMATHGoogle Scholar
  9. 9.
    Wang, P.Y., Wäscher, G.: Editorial – cutting and packing. European Journal of Operational Research 141(2), 239–240 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Arianna Alfieri
    • 1
  • Steef L. van de Velde
    • 2
  • Gerhard J. Woeginger
    • 3
  1. 1.Dipartimento dei Sistemi di Produzione ed Economia dell’AziendaPolytechnic University of TorinoTorinoItaly
  2. 2.Rotterdam School of ManagementErasmus UniversityRotterdamThe Netherlands
  3. 3.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations