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

Dettagli Bibliografici
Pubblicato in:	Information processing letters. 61, 4 (1997).
Autore principale:	Olmo, P. Dell
Natura:	Articolo
Lingua:	English
Soggetti:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.