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

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters. 61, 4 (1997).
1. Verfasser:	Olmo, P. Dell
Format:	Artikel
Sprache:	English
Schlagworte:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.