We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem
We introduce a model for non-preemptive scheduling under uncertainty. In this model, we combine the ...
We consider the problem to minimize the total weighted completion time of a set of jobs with individ...
Minimizing the sum of completion times when scheduling jobs on identical parallel machines is a fun...
We present first constant performance guarantees for preemptive stochastic scheduling to minimize th...
We present first constant performance guarantees for preemptive stochastic scheduling to minimize th...
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize...
We consider the stochastic identical parallel machine scheduling problem and its online extension, w...
We consider dynamic stochastic scheduling of preemptive jobs with processing times that follow indep...
We introduce a model for non-preemptive scheduling under uncertainty. In this model, we combine the ...
Abstract. We consider a non-preemptive, stochastic parallel machine scheduling model with the goal t...
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize...
We introduce a model for non-preemptive scheduling under uncertainty. In this model, we combine the ...
We consider the problem to minimize the total weighted completion time of a set of jobs with individ...
Minimizing the sum of completion times when scheduling jobs on identical parallel machines is a fun...
We present first constant performance guarantees for preemptive stochastic scheduling to minimize th...
We present first constant performance guarantees for preemptive stochastic scheduling to minimize th...
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize...
We consider the stochastic identical parallel machine scheduling problem and its online extension, w...
We consider dynamic stochastic scheduling of preemptive jobs with processing times that follow indep...
We introduce a model for non-preemptive scheduling under uncertainty. In this model, we combine the ...
Abstract. We consider a non-preemptive, stochastic parallel machine scheduling model with the goal t...
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize...
We introduce a model for non-preemptive scheduling under uncertainty. In this model, we combine the ...
We consider the problem to minimize the total weighted completion time of a set of jobs with individ...
Minimizing the sum of completion times when scheduling jobs on identical parallel machines is a fun...
DOI
Add to ORKG