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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Alfieri, A., Van De Velde, S. L., & Woeginger, G. J. (2005). Roll cutting in the curtain industry. In Lecture Notes in Computer Science (Vol. 3669, pp. 283–292). Springer Verlag. https://doi.org/10.1007/11561071_27
Mendeley helps you to discover research relevant for your work.