Results 1  10
of
1,151,106
A PTAS For Minimizing The Total Weighted Completion Time On Identical Parallel Machines
 MATHEMATICS OF OPERATIONS RESEARCH
, 1999
"... We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1 + p 2)approximation algorithm that has been der ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1 + p 2)approximation algorithm that has been
The Implementation of the Cilk5 Multithreaded Language
, 1998
"... The fifth release of the multithreaded language Cilk uses a provably good "workstealing " scheduling algorithm similar to the rst system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided ..."
Abstract

Cited by 479 (27 self)
 Add to MetaCart
, this "workfirst" principle has led to a portable Cilk5 implementation in which the typical cost of spawning a parallel thread is only between 2 and 6 times the cost of a C function call on a variety of contemporary machines. Many Cilk programs run on one processor with virtually no degradation
Scheduling with Rejection to Minimize the Total Weighted Completion Time ∗
"... Abstract In this paper, we address the scheduling problem with rejection in which we can choose a subset of jobs to process. Choosing not to process any job incurs a corresponding penalty. We consider the following problem for the first time: scheduling with rejection to minimize the total weighted ..."
Abstract
 Add to MetaCart
completion time with the constraint of total penalties on identical parallel machines, where the number of identical parallel machines is constant. We show that it is NPhard and design a pseudopolynomial time algorithm as well as an FPTAS through dynamic programming.
MINIMIZING THE TOTAL WEIGHTED COMPLETION TIME ON UNRELATED PARALLEL MACHINES WITH STOCHASTIC TIMES
"... This paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the weighted mean completion time. Identical jobs are batched together and are available at time zero. Processing time of each job of a ..."
Abstract
 Add to MetaCart
This paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the weighted mean completion time. Identical jobs are batched together and are available at time zero. Processing time of each job
Parallelmachine scheduling with simple linear deterioration to minimize total completion time
 European Journal of Operational Research
"... to minimize total completion time ..."
Scheduling to Minimize Average Completion Time: Offline and Online Algorithms
, 1996
"... Timeindexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of singlemachine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good wo ..."
Abstract

Cited by 226 (24 self)
 Add to MetaCart
, we consider the problem of minimizing the total weighted job completion time on a single machine subject to precedence constraints, and give a polynomialtime (4 + ffl)approximation algorithm, for any ffl ? 0; the best previously known guarantee for this problem was superlogarithmic. With somewhat
Total stretch minimization on single and identical parallel machines
"... Abstract. We consider the classical problem of scheduling n jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job by its stretch, which is defined as the ratio of its response time to processing time. Our objective is to schedu ..."
Abstract
 Add to MetaCart
Abstract. We consider the classical problem of scheduling n jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job by its stretch, which is defined as the ratio of its response time to processing time. Our objective
Scheduling Multiple Families of Jobs on Parallel Machines to Minimize Total Weighted Completion Time
, 2000
"... We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem# a setup time is necessary whenever a job from one family is processed immediately after another job from a di#erent family. The ..."
Abstract
 Add to MetaCart
We consider the problem of scheduling multiple families of jobs on identical parallel machines to minimize the total weighted completion time of the jobs. In this problem# a setup time is necessary whenever a job from one family is processed immediately after another job from a di#erent family
A PTAS for minimizing the weighted sum of job completion times on parallel machines
, 1999
"... We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1+ p 2)approximation algorithm that has been der ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1+ p 2)approximation algorithm that has been
Preemptive Weighted Completion Time Scheduling of Parallel Jobs
 In Proceedings of the 4 th Annual European Symposium on Algorithms (ESA96
, 1996
"... In this paper we present a new algorithm for the offline scheduling of parallel and independent jobs on a parallel processor system. To this end we introduce a machine model which is based on existing multiprocessors and accounts for the penalty of preemption. After examining the relation between t ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
the makespan and the total weighted completion time costs for the scheduling of parallel jobs it is shown that the new algorithm achieves a small approximation factor for both total weighted completion time and makespan scheduling. To fine tune the algorithm a fairly simple numerical optimization problem
Results 1  10
of
1,151,106