An interactive technique for the cutting stock problem with multiple objectives

DOI10.1016/0377-2217(94)90042-6zbMath0813.90091OpenAlexW1998070111MaRDI QIDQ1342019

Reda M. S. Abd El-Aal

Publication date: 30 May 1995

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90042-6

zbMATH Keywords

manufacturingmultiple criteria decision makingpattern generationinteractive techniquelarge scale multiple-objective integer linear programmingtwo-dimensional cutting stock

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27)

Cites Work

• Heuristics for sequencing cutting patterns
• Trim-loss pattern rearrangement and its relevance to the flat-glass industry
• Cutting stock problems and solution procedures
• An improved version of Wang's algorithm for two-dimensional cutting problems
• A typology of cutting and packing problems
• The cutting stock problem in the canvas industry
• An LP-based approach to cutting stock problems with multiple objectives
• Optimal solutions for the cutting stock problem

This page was built for publication: An interactive technique for the cutting stock problem with multiple objectives