Stochastic Online Scheduling on Unrelated Machines

We derive the first performance guarantees for a combinatorial online algorithm that schedules stochastic, non-preemptive jobs on unrelated machines to minimize the expectation of the total weighted completion time. Prior work on unrelated machine scheduling with stochastic jobs was restricted to the offline case, and required sophisticated linear or convex programming relaxations for the assignment of jobs to machines. Our algorithm is purely combinatorial, and therefore it also works for the online setting. As to the techniques applied, this paper shows how the dual fitting technique can be put to work for stochastic and non-preemptive scheduling problems.