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

書誌詳細
出版年:	Information processing letters. 61, 4 (1997).
第一著者:	Olmo, P. Dell
フォーマット:	論文
言語:	English
主題:	Parallel processing. Scheduling. Coloring. Computational complexity. Approximation algorithms.