The solution of two-stage guillotine cutting stock problems having extremely varying order demands

DOI10.1016/0377-2217(95)00200-6zbMath0918.90122OpenAlexW2088298012MaRDI QIDQ1278246

Jan Riehme, Guntram Scheithauer, Johannes Terno

Publication date: 27 April 1999

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

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

zbMATH Keywords

column generationlinear programming relaxationcutting stock problemtwo-stage guillotine cutting

Mathematics Subject Classification ID

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

Related Items (14)

Models for the two-dimensional two-stage cutting stock problem with multiple stock size ⋮ An improved typology of cutting and packing problems ⋮ An integrated cutting stock and sequencing problem ⋮ A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size ⋮ Improving competitiveness in veneers production by a simple-to-use DSS. ⋮ Trim loss optimization by an improved differential evolution ⋮ Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation ⋮ A note on linear models for two-group and three-group two-dimensional guillotine cutting problems ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais ⋮ On a 2-dimensional equipartition problem ⋮ Linear models for 1-group two-dimensional guillotine cutting problems ⋮ An efficient approach for the multi-pallet loading problem ⋮ Analysis of distributed genetic algorithms for solving cutting problems

Cites Work

• Unnamed Item
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• Limiting the number of each piece in two-dimensional cutting stock patterns
• A typology of cutting and packing problems
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
• An Algorithm for Two-Dimensional Cutting Problems
• Multistage Cutting Stock Problems of Two and More Dimensions

This page was built for publication: The solution of two-stage guillotine cutting stock problems having extremely varying order demands