109 search results - page 2 / 22 » Convex programming for scheduling unrelated parallel machine... |
ECCC
2000
14 years 11 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
INFORMS
2002
14 years 11 months ago
2002
EOR
2010
14 years 11 months ago
2010
113
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...