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

Dades bibliogràfiques
Publicat a:	Information processing letters. 61, 4 (1997).
Autor principal:	Olmo, P. Dell
Format:	Article
Idioma:	English
Matèries:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.