33 search results - page 1 / 7 » Size-reduction heuristics for the unrelated parallel machine... |
COR
2011
13 years 1 days ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di�...
EOR
2010
13 years 5 months ago
2010
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
ECCC
2000
13 years 4 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 ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
IJAIT
2007
13 years 5 months ago
2007
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...