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

Bibliografiska uppgifter
I publikationen:	Information processing letters. 61, 4 (1997).
Huvudupphovsman:	Olmo, P. Dell
Materialtyp:	Artikel
Språk:	English
Ämnen:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.