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

Bibliografiske detaljer
Udgivet i:	Information processing letters. 61, 4 (1997).
Hovedforfatter:	Olmo, P. Dell
Format:	Article
Sprog:	English
Fag:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.