Results 1  10
of
405,912
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 266 (6 self)
 Add to MetaCart
polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer
Efficient Approximation Algorithms for Scheduling Unrelated Parallel Machines
"... Abstract. Scheduling n independent jobs on m Unrelated Parallel Machines (SUM) is the problem of assigning n jobs j = 1,.., n to m machines i = 1,..,m so that each job is processed without interruption on one of the machines, and at any time, every machine processes at most one job. The objective is ..."
Abstract
 Add to MetaCart
Abstract. Scheduling n independent jobs on m Unrelated Parallel Machines (SUM) is the problem of assigning n jobs j = 1,.., n to m machines i = 1,..,m so that each job is processed without interruption on one of the machines, and at any time, every machine processes at most one job. The objective
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines.Theor
 Comput. Sci
"... Abstract. We consider the problem of scheduling n independent jobs on m unrelated parallel machines without preemption. Job i takes processing time pij on machine j, and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize ma ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Abstract. We consider the problem of scheduling n independent jobs on m unrelated parallel machines without preemption. Job i takes processing time pij on machine j, and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
 252 PESQUISA OPERACIONAL, V.24, N.2
, 2001
"... This paper presents an empirical comparison of polynomialtime approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worstcase performance guarantee are based on rounding a fractional solut ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper presents an empirical comparison of polynomialtime approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worstcase performance guarantee are based on rounding a fractional
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
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
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
"... Abstract We design a 1.75approximation algorithm for a specialcase of scheduling parallel machines to minimize the makespan, namely the case where each job can beassigned to at most two machines, with the same processing time on either machine. (This is a specialcase of socalled restricted assignm ..."
Abstract
 Add to MetaCart
Abstract We design a 1.75approximation algorithm for a specialcase of scheduling parallel machines to minimize the makespan, namely the case where each job can beassigned to at most two machines, with the same processing time on either machine. (This is a specialcase of socalled restricted
Graph Balancing: A Special Case of Scheduling Unrelated Parallel
 Machines, Proceedings of Symposium on Discrete Algorithms (SODA
, 2008
"... We design a 1.75approximation algorithm for a special case of scheduling parallel machines to minimize the makespan, namely the case of restricted assignment where each job can be assigned to at most two machines. We also show that even for this special case it is NPhard to compute better than 1.5 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
.5 approximation. This is the first improvement of the approximation ratio 2 of Lenstra, Shmoys, and Tardos [Approximation algorithms for scheduling 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
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a
Software pipelining: An effective scheduling technique for VLIW machines
, 1988
"... This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software pipe ..."
Abstract

Cited by 579 (3 self)
 Add to MetaCart
This paper shows that software pipelining is an effective and viable scheduling technique for VLIW processors. In software pipelining, iterations of a loop in the source program are continuously initiated at constant intervals, before the preceding iterations complete. The advantage of software
Greedy Function Approximation: A Gradient Boosting Machine
 Annals of Statistics
, 2000
"... Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed for additi ..."
Abstract

Cited by 951 (12 self)
 Add to MetaCart
Function approximation is viewed from the perspective of numerical optimization in function space, rather than parameter space. A connection is made between stagewise additive expansions and steepest{descent minimization. A general gradient{descent \boosting" paradigm is developed
Results 1  10
of
405,912