The one-dimensional cutting stock problem with sequence-dependent cut losses

The paper presents a new generalization of the one‐dimensional cutting stock problem (1D‐CSP) that considers cut losses dependent on the items' cutting sequence. It is shown that this generalization can still be solved approximately by standard 1D‐CSP approaches. Furthermore, a pattern‐based heuristic (denoted by 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 generalization.