Establishing the optimality of sequencing heuristics for cutting stock problems

DOI10.1016/0377-2217(95)00025-LzbMath0918.90125MaRDI QIDQ1127215

Boon J. Yuen, Ken V. Richardson

Publication date: 19 August 1999

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

zbMATH Keywords

branch-and-boundlower boundexact methodscutting stock

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (14)

A method for solving the minimization of the maximum number of open stacks problem within a cutting process ⋮ An improved typology of cutting and packing problems ⋮ An integrated cutting stock and sequencing problem ⋮ Two-dimensional cutting stock problem with sequence dependent setup times ⋮ Mathematical models for the minimization of open stacks problem ⋮ On the one-dimensional stock cutting problem in the paper tube industry ⋮ Lock-free parallel dynamic programming ⋮ The design of the zinc modelling language ⋮ A biased random-key genetic algorithm for the minimization of open stacks problem ⋮ Applying genetic algorithms and neural networks to the container loading problem ⋮ The minimization of open stacks problem: a review of some properties and their use in pre-processing operations ⋮ A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry ⋮ Heuristic and exact methods for the cutting sequencing problem ⋮ Simulated annealing for order spread minimization in sequencing cutting patterns

Cites Work

• Unnamed Item
• Heuristics for sequencing cutting patterns
• Improved heuristics for sequencing cutting patterns
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Glass cutting in a small firm

This page was built for publication: Establishing the optimality of sequencing heuristics for cutting stock problems