Sciweavers

Share
35 search results - page 1 / 7
» Minimizing the makespan for Unrelated Parallel Machines
Sort
View
IJAIT
2007
119views more  IJAIT 2007»
11 years 11 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
ECCC
2000
140views more  ECCC 2000»
11 years 11 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
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 ...
Pavlos Efraimidis, Paul G. Spirakis
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
12 years 6 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
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 ...
José R. Correa, Martin Skutella, José...
LATIN
2010
Springer
12 years 1 months ago
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
Eric Angel, Evripidis Bampis, Nicolas Thibault
CORR
2010
Springer
133views Education» more  CORR 2010»
11 years 12 months ago
Santa Claus Schedules Jobs on Unrelated Machines
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
Ola Svensson
books