Roll Cutting in the Curtain Industry
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.
KeywordsAllocation Problem Customer Order Binary Search Tree Preprocessing Phase Core Instance
Unable to display preview. Download preview PDF.