Solving a bi-criterion cutting stock problem with open-ended demand: a case study

DOI10.1057/palgrave.jors.2601023zbMath1107.90003OpenAlexW2111565704MaRDI QIDQ3156669

Antoon W. J. Kolen, Frits C. R. Spieksma

Publication date: 10 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601023

zbMATH Keywords

cutting stock problemmulti-objectivepractice of OR

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Inventory, storage, reservoirs (90B05)

Related Items (3)

Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ Heuristic algorithms based on column generation for an online product shipping problem

This page was built for publication: Solving a bi-criterion cutting stock problem with open-ended demand: a case study