Sciweavers

159 search results - page 10 / 32
» Machine Minimization for Scheduling Jobs with Interval Const...
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 1 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
CORR
2007
Springer
131views Education» more  CORR 2007»
14 years 9 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
DAGSTUHL
2006
14 years 10 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
SWAT
2004
Springer
142views Algorithms» more  SWAT 2004»
15 years 2 months ago
Getting the Best Response for Your Erg
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woe...
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma