The one‐dimensional cutting stock problem with sequence‐dependent setups
The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects. Auxiliary objectives often arise when solving the CSP, with a common one b...