Title of article
An approximation result for a duo-processor task scheduling problem
Author/Authors
P. DellʹOlmo، نويسنده , , S. Giordani، نويسنده , , M. G. Speranza، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1997
Pages
6
From page
195
To page
200
Keywords
Scheduling , coloring , computational complexity , Approximation algorithms , Parallel processing
Journal title
Information Processing Letters
Serial Year
1997
Journal title
Information Processing Letters
Record number
128635
Link To Document