An approximation result for a duo-proces
✍
P. Dell'Olmo; S. Giordani; M.G. Speranza
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 479 KB
We consider the problem of scheduling tasks on a set of dedicated processors, where each task requires a subset of two processors be simultaneously available for a given processing time. The objective is to determine a nonpreemptive schedule with minimum completion time. By means of a graph theoreti