The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
Operations Research · 1987 · Volume 35 · Issue 6
Abstract
We consider a situation in which n jobs, requiring random amounts of processing, all with the same mean, are to be scheduled on m parallel machines with respect to one of two objectives: expected flowtime and expected makespan. We discuss optimality of the rule that says to schedule the jobs with the largest variance first (LVF). We show that for some very simple job length distributions, LVF minimizes both the expected flowtime and the expected makespan.
Keywords
592 priority scheduling by variance of stochastic processing time
Enable JavaScript for citation tools and additional paper interactions.