An approximation result for a duo-processor task scheduling problem.

An approximation result for a duo-processor task scheduling problem.

Detalhes bibliográficos
Publicado no:Information processing letters. 61, 4 (1997).
Autor principal: Olmo, P. Dell
Formato: Artigo
Idioma:English
Assuntos:
Parallel processing.
Scheduling.
Coloring.
Computational complexity.
Approximation algorithms.