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

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

Xehetasun bibliografikoak
Argitaratua izan da:Information processing letters. 61, 4 (1997).
Egile nagusia: Olmo, P. Dell
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Parallel processing.
Scheduling.
Coloring.
Computational complexity.
Approximation algorithms.