Heuristic methods for gang-rip saw arbor design.

DOI10.1016/S0377-2217(02)00796-8zbMath1053.90113MaRDI QIDQ1420446

Yahya Fathi, Vural Aksakalli

Publication date: 2 February 2004

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

zbMATH Keywords

HeuristicsCombinatorial optimizationComputational complexityLumber cutting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Uses Software

• Genocop
• GRADS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-optimal solutions to one-dimensional cutting stock problems
• A two-phase roll cutting problem
• The cutting stock problem in the canvas industry
• Application of Mathematical Programming to the Plywood Design and Manufacturing Problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Technical Note—Forest Outturn Optimization by Dantzig-Wolfe Decomposition and Dynamic Programming Column Generation
• Polynomial Complete Consecutive Information Retrieval Problems
• A column generation procedure for gang-rip saw arbor design and scheduling

This page was built for publication: Heuristic methods for gang-rip saw arbor design.