| Article ID: | iaor2005606 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 14 |
| Start Page Number: | 2315 |
| End Page Number: | 2332 |
| Publication Date: | Dec 2004 |
| Journal: | Computers and Operations Research |
| Authors: | Yanasse Horacio Hideki, Soma Nei Yoshihiro, Becceneri Jos Carlos |
| Keywords: | heuristics, programming: branch and bound |
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.