International Transactions in Operational Research vol:23 issue:1-2 pages:5-24
The paper presents a new generalisation of the one-dimensional cutting stock problem (1D-CSP) that considers cut losses that depend on the items’ cutting sequence. It is shown that this generalisation can still be solved approximately by standard 1D-CSP approaches. Furthermore, a pattern-based heuristic (denoted HSD) is presented that specifically considers
sequence dependent cut losses (SDCL). A computational study shows that whenever some variability in SDCL occurs consideration of SDCL in the HSD heuristic is beneficial. Finally, two case studies illustrate the relevance of this new generalisation.