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

Detaylı Bibliyografya
Yayımlandı:	Information processing letters. 61, 4 (1997).
Yazar:	Olmo, P. Dell
Materyal Türü:	Makale
Dil:	English
Konular:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.