Results 1  10
of
214,229
unrelated parallel machine scheduling
"... tabu search and a truncated branchandbound for the ..."
Minimizing the Makespan for Unrelated Parallel Machines
, 2003
"... In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NPhard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NPhard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results
APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
, 1990
"... We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a polynomi ..."
Abstract

Cited by 265 (7 self)
 Add to MetaCart
We consider the following scheduling problem. There are m parallel machines and n independent.jobs. Each job is to be assigned to one of the machines. The processing of.job j on machine i requires time Pip The objective is to lind a schedule that minimizes the makespan. Our main result is a
Unrelated Parallel Machines Scheduling and Scheduling
"... In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that have numerous applications and can be used in approximation algorithms for Minimum Quadratic Spa ..."
Abstract
 Add to MetaCart
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that have numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree,
A Unified Approach to Scheduling on Unrelated Parallel Machines
, 2005
"... We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming, quadratic programming, and convex programmingrelaxations for scheduling to minimize completion time, makespan, and other wellstudied objective functio ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We develop a single rounding algorithm for scheduling on unrelated parallel machines; this algorithm works well with the known linear programming, quadratic programming, and convex programmingrelaxations for scheduling to minimize completion time, makespan, and other wellstudied objective
Complexity of preemptive minsum scheduling on unrelated parallel machines
 Journal of Algorithms
, 2005
"... We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NPhard in the strong sense. The former result settles a longstanding open question. A special case of the unrelated machine m ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We show that the problems of minimizing total completion time and of minimizing the number of late jobs on unrelated parallel machines, when preemption is allowed, are both NPhard in the strong sense. The former result settles a longstanding open question. A special case of the unrelated machine
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
 In ACM symposium on Theory of computing
, 1999
"... We consider the problem of scheduling n independent jobs on m unrelated parallel machines, where each job has to be processed by exactly one machine, processing job j on machine i requires p ij time units, and the objective is to minimize the makespan, i.e. the maximum job completion time. Focusing ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
We consider the problem of scheduling n independent jobs on m unrelated parallel machines, where each job has to be processed by exactly one machine, processing job j on machine i requires p ij time units, and the objective is to minimize the makespan, i.e. the maximum job completion time. Focusing
A Special Case of Scheduling Unrelated Parallel Machines
, 2007
"... We design a 1.75approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case where each job can be assigned to at most two machines, with the same processing time on either machine. (This is a special case of socalled restricted assignment, w ..."
Abstract
 Add to MetaCart
unrelated parallel machines, Math. Program., 46:259–271, 1990], for any special case with unbounded number of machines. Our lower bound yields the same ratio as their lower bound which works for restricted assignment, and which is still the stateoftheart lower bound even for the most general case.
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
 Electronic Colloquium on Computational Complexity (ECCC
, 2000
"... The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is fixed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed, ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is fixed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed
Results 1  10
of
214,229