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

書目詳細資料
發表在:	Information processing letters. 61, 4 (1997).
主要作者:	Olmo, P. Dell
格式:	Article
語言:	English
主題:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.