|
|
|
|
|
Anurag Agarwal, Selcuk Colak, Jason Deane, Terry Rakes
This paper addresses the task scheduling problem which involves minimizing the makespan in scheduling n tasks on m machines (resources) where the tasks follow a precedence relation and preemption is not allowed. The machines (resources) are all identical...
ver más
|
|
|
|
|