A method for solving the minimization of the maximum number of open stacks problem within a cutting process |
| |
| Authors: | Jos Carlos Becceneri, Horacio Hideki Yanasse,Nei Yoshihiro Soma |
| |
| Affiliation: | José Carlos Becceneri, Horacio Hideki Yanasse,Nei Yoshihiro Soma, |
| |
| 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: | Cutting stock Pattern sequencing Graph traversing Branch-and-bound |
| 本文献已被 ScienceDirect 等数据库收录！ |
