<b>Evaluation of heuristics for a branch and bound algorithm to minimize the makespan in a flowshop with blocking
This paper has the objective to evaluate the use of different methods to obtain an initial solution for the branch and bound algorithm with the objective of minimizing the makespan in a flowshop with zero buffer environment. As the problem is known to be NP-Hard, the branch and bound algorithm may t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidade Estadual de Maringá
2016-06-01
|
| Series: | Acta Scientiarum: Technology |
| Subjects: | |
| Online Access: | http://periodicos.uem.br/ojs/index.php/ActaSciTechnol/article/view/28438 |