Results 1 - 10 of 279

Truthful Mechanisms for One-Parameter Agents

by Aron Archer, Eva Tardos
"... In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s sec ..."
Abstract - Cited by 232 (3 self) - Add to MetaCart
truthful mechanisms for maximum flow, Qjj P Cj (scheduling related machines to minimize the sum of completion times), optimizing an affine function over a fixed set, and special cases of uncapacitated facility location. In addition, for Qjj P wjCj (minimizing the weighted sum of completion times), we prove

Parallel Machine Scheduling to Minimize the Sum of Quadratic Completion Times

by T. C. Edwin Cheng, Zhaohui Liu , 2002
"... We consider the parallel machine scheduling problem of minimizing the sum of quadratic job completion times. We first prove that the problem is strongly NP-hard. We then demonstrate by probabilistic analysis that the shortest processing time rule solves the problem asymptotically. The relative error ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We consider the parallel machine scheduling problem of minimizing the sum of quadratic job completion times. We first prove that the problem is strongly NP-hard. We then demonstrate by probabilistic analysis that the shortest processing time rule solves the problem asymptotically. The relative

An approximation algorithm for the generalized assignment problem

by David B. Shmoys, Eva Tardos , 1993
"... The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing job j on machine i requires time pif and incurs a cost of c,f, each machine / is available for 7", time units, ..."
Abstract - Cited by 200 (5 self) - Add to MetaCart
-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given values M and 7", either proves

Scheduling to Minimize the Average Completion Time of Dedicated Tasks

by Foto Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon , 2000
"... We propose a polynomial time approximation scheme for scheduling a set of dedicated tasks on a constant number m of processors in order to minimize the sum of completion times Pmjx j j P C j . In addition we give a polynomial time approximation scheme for the weighted preemptive problem with ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
We propose a polynomial time approximation scheme for scheduling a set of dedicated tasks on a constant number m of processors in order to minimize the sum of completion times Pmjx j j P C j . In addition we give a polynomial time approximation scheme for the weighted preemptive problem

Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine

by Chandra Chekuri, Rajeev Motwani - Discrete Applied Mathematics , 1997
"... We consider the problem of scheduling a set of jobs on a single machine with the objective of minimizing sum of weighted completion times. The problem is NP-hard when there are precedence constraints between jobs [15]. We provide an efficient combinatorial 2-approximation algorithm for this problem. ..."
Abstract - Cited by 28 (0 self) - Add to MetaCart
We consider the problem of scheduling a set of jobs on a single machine with the objective of minimizing sum of weighted completion times. The problem is NP-hard when there are precedence constraints between jobs [15]. We provide an efficient combinatorial 2-approximation algorithm for this problem

A PTAS for minimizing the weighted sum of job completion times on parallel machines

by Martin Skutella, Gerhard J. Woeginger , 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 NP-hard 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 NP-hard in the strong sense. The best approximation result known so far was a 1 2 (1+ p 2)--approximation algorithm that has been

Combinatorial Algorithms for Minimizing the Weighted Sum of Completion Times on a Single Machine

by James M. Davis, Rajiv Gandhi, Vijay Kothari , 2012
"... We study the problem of minimizing the weighted sum of completion times of jobs with release dates on a single machine with the aim of shedding new light on “the simplest [linear program] relaxation ” [17]. Specifically, we analyze a 3-competitive online algorithm [16], using dual-fitting. In the of ..."
Abstract - Add to MetaCart
We study the problem of minimizing the weighted sum of completion times of jobs with release dates on a single machine with the aim of shedding new light on “the simplest [linear program] relaxation ” [17]. Specifically, we analyze a 3-competitive online algorithm [16], using dual

PREEMPTIVE MULTIPROCESSOR TASK SCHEDULING TO MINIMIZE THE SUM OF COMPLETION TIMES MICHAŁ MAŁAFIEJSKI, ŁUKASZ KUSZNER,

by Konrad Piwakowski
"... Abstract: In this paper we consider a problem of preemptive scheduling of multiprocessor tasks on dedicated processors in order to minimize the sum of completion times. Using the standard notation this problem is denoted as P|fix j, pmtn|ΣCj. We give a wide class of polynomial cases in terms of conf ..."
Abstract - Add to MetaCart
Abstract: In this paper we consider a problem of preemptive scheduling of multiprocessor tasks on dedicated processors in order to minimize the sum of completion times. Using the standard notation this problem is denoted as P|fix j, pmtn|ΣCj. We give a wide class of polynomial cases in terms

Task Scheduling With Precedence Constraints to Minimize the Total Completion Time

by Jou-ming Chang, Chiun-Chieh Hsu
"... In this paper, we study the problem of scheduling a set of tasks with known execution times and arbitrary precedence constraints to computing systems. The objective function used to measure the performance of a schedule in this paper is the total completion time (the sum of completion times of all t ..."
Abstract - Add to MetaCart
In this paper, we study the problem of scheduling a set of tasks with known execution times and arbitrary precedence constraints to computing systems. The objective function used to measure the performance of a schedule in this paper is the total completion time (the sum of completion times of all

Coordination Mechanisms for Weighted Sum of Completion Times

by Richard Cole, Vasilis Gkatzelis, Vahab Mirrokni , 2010
"... We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling. In shor ..."
Abstract - Add to MetaCart
We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design local policies that achieve a good price of anarchy in the resulting equilibria for unrelated machine scheduling
Results 1 - 10 of 279