Title of article
A method for solving the minimization of the maximum number of open stacks problem within a cutting process
Author/Authors
José Carlos Becceneri، نويسنده , , Horacio Hideki Yanasse، نويسنده , , Nei Yoshihiro Soma، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2004
Pages
18
From page
2315
To page
2332
Abstract
In this paper, the problem of minimizing the maximum number of open stacks around a saw machine is addressed. A new heuristic and a branch-and-bound based exact method for the problem are presented. Computational tests comparing the new approach with other algorithms previously suggested in the literature were carried out.
Keywords
Graph traversing , Pattern sequencing , Cutting stock , branch-and-bound
Journal title
Computers and Operations Research
Serial Year
2004
Journal title
Computers and Operations Research
Record number
928142
Link To Document