Approximation solutions for the cutting stock `portfolio' problem

DOI10.1016/0377-2217(90)90352-CzbMath0684.90004OpenAlexW2009993297MaRDI QIDQ1825733

Jerry L. Sanders, Douglas D. Gemmill

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90352-c

zbMATH Keywords

approximate solutionsinventoryportfolio selectioncutting stockengineering guidelines

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)

Related Items (4)

Solving a cutting problem based on existing patterns ⋮ An optimization model for trim loss minimization in an automotive glass plant ⋮ Determining the best shipper sizes for sending products to customers ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem

Cites Work

• An algorithm for the two-dimensional assortment problem
• Scheduling a two-machine flowshop with travel times to minimize maximum lateness

This page was built for publication: Approximation solutions for the cutting stock `portfolio' problem