Two-dimensional cutting stock problem with sequence dependent setup times

DOI10.1016/j.ejor.2017.07.036zbMath1374.90277WikidataQ47036966 ScholiaQ47036966MaRDI QIDQ1681356

Peng Zhang

Publication date: 23 November 2017

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.036

zbMATH Keywords

heuristics; cutting stock problem; application; sequence dependent setup times

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C59: Approximation methods and heuristics in mathematical programming

90B90: Case-oriented studies in operations research

90B80: Discrete location and assignment