Practical comparison of approximation algorithms for scheduling problems

Practical comparison of approximation algorithms for scheduling problems

In this paper we consider an experimental study of approximation algorithms for scheduling problems in parallel machines minimizing the average weighted completion time. We implemented approximation algorithms for the following problems: P|r j|sigmaCj, P||sigmaw jCj, P|r j|sigmaw jCj, R||sigmaw jCj...

Full description

Bibliographic Details
Main Authors: Eduardo Candido Xavier, Flávio K. Miyazawa
Format: Article
Language:English
Published: Sociedade Brasileira de Pesquisa Operacional 2004-08-01
Series:Pesquisa Operacional
Subjects:
algoritmos de aproximação
análise prática
escalonamento
approximation algorithms
practical analysis
scheduling
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000200002

Internet

http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000200002

Similar Items