Sciweavers

112 search results - page 1 / 23
» Bi-objective Optimization: An Online Algorithm for Job Assig...
Sort
View
SCHEDULING
2011
12 years 11 months ago
On robust online scheduling algorithms
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs...
Michael Gatto, Peter Widmayer
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
13 years 11 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 4 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
COR
2011
12 years 11 months ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...