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

Detalles Bibliográficos
Publicado en:	Information processing letters. 61, 4 (1997).
Autor Principal:	Olmo, P. Dell
Formato:	Artigo
Idioma:	English
Subjects:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.