Please use this identifier to cite or link to this item:
|Title:||Experimentos com formulações de programação inteira para o problema do permutation flowshop|
|Other Titles:||Experiments with integer programming formulations for the permutation flowshop|
|Keywords:||Engenharia de produção; Programação inteira; Escalonamento de tarefas; Regra de Branch; Formulações; Integer programming; Permutation flowshop; Scheduling; Branch rule; formulations|
|Abstract:||The Permutation Flowshop problem is one of the most well-known problems in the field of scheduling and has been intensely explored since the 1950s. The present work brings two contributions for the study of this problem in the context of integer programming. The first is an experimental evaluation of the effect of some branch rules (inspired in Potts rule proposed in the 1980s) in the performance of a branch-and-bound algorithm over the classic Wilson s formulation. The second contribution is the analysis of a new formulation whose linear relaxation yields better lower bounds than the Wilson s formulation does.|
|Appears in Collections:||TEDE com arquivos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.