
Scheduling with Testing on Multiple Identical Parallel Machines
Scheduling with testing is a recent online problem within the framework ...
read it

Weighted completion time minimization for capacitated parallel machines
We consider the weighted completion time minimization problem for capaci...
read it

Performance of the smallestvariancefirst rule in appointment sequencing
A classical problem in appointment scheduling, with applications in heal...
read it

Stochastic Nonpreemptive Coflow Scheduling with TimeIndexed Relaxation
Coflows model a modern scheduling setting that is commonly found in a v...
read it

CommunicationAware Scheduling of PrecedenceConstrained Tasks on Related Machines
Scheduling precedenceconstrained tasks is a classical problem that has ...
read it

Minimization of Weighted Completion Times in Pathbased Coflow Scheduling
Coflow scheduling models communication requests in parallel computing fr...
read it

Prompt Scheduling for Selfish Agents
We give a prompt online mechanism for minimizing the sum of [weighted] c...
read it
Generalizing the KawaguchiKyan bound to stochastic parallel machine scheduling
Minimizing the sum of weighted completion times on m identical parallel machines is one of the most important classical scheduling problems. For the stochastic variant where processing times of jobs are random variables, in 1999, Möhring, Schulz, and Uetz presented the first and still best known approximation result, achieving, for arbitrarily many machines, performance guarantee 1 + 1 2 · (1+Δ), where Δ is an upper bound on the squared coefficient of variation of the processing times. We prove performance guarantees 1 + 1 2 (√(2)  1) · (1+Δ) for arbitrary Δ and 1 + 1 6 · (1+Δ) for Δ> 1 for the same underlying algorithmthe Weighted Shortest Expected Processing Time (WSEPT) rule. For the special case of deterministic scheduling (i.e. Δ = 0), our bound matches the tight performance ratio 1 2 (1+√(2)) of this algorithm (WSPT rule) by Kawaguchi and Kyan from 1986.
READ FULL TEXT
Comments
There are no comments yet.