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

Podrobná bibliografie
Vydáno v:	Information processing letters. 61, 4 (1997).
Hlavní autor:	Olmo, P. Dell
Médium:	Článek
Jazyk:	English
Témata:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.