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

Bibliographic Details
Published in:	Information processing letters. 61, 4 (1997).
Main Author:	Olmo, P. Dell
Format:	Article
Language:	English
Subjects:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.