 One-Dimensional Cutting StockGuntram Scheithauer
Chapter Chapter 4 in Introduction to Cutting and Packing Optimization, 2018, pp 73-122 from Springer Abstract: Abstract In difference to one-dimensional Bin Packing Problems (1BPP) where each item is considered to be a unique one, in a one-dimensional Cutting Stock Problem (1CSP), the number of different piece types is rather small, but their order demands (or availability in case of packing problems) are mostly large. Another differentiator of bin packing and cutting stock problems could be the magnitude of the respective optimal value. If it is small in comparison to the total number of items, then the instance is of BPP type, otherwise the problem type depends on the number of different patterns in a solution. In the beginning of this chapter, we consider the 1CSP with a single type of raw material. We present a solution strategy which is also applicable to higher-dimensional problems as, for instance, in the furniture industry when the production of rectangular pieces has to be optimized. Subsequently, we address generalizations and present alternative models. Finally, we investigate the relation between the standard ILP model and its LP relaxation and observe a small gap for any 1CSP instance. Date: 2018 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-64403-5_4 Ordering information: This item can be ordered from DOI: 10.1007/978-3-319-64403-5_4 Access Statistics for this chapter More chapters in International Series in Operations Research & Management Science from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.