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

Bibliografski detalji
Izdano u:	Information processing letters. 61, 4 (1997).
Glavni autor:	Olmo, P. Dell
Format:	Članak
Jezik:	English
Teme:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.