Greedy Algorithms Are Good Enough (for Scheduling under Uncertainty)

Activity: Talk or presentationInvited talk


The talk addresses a classical problem in the area of scheduling, namely minimizing the total weighted completion time of non-preemptive jobs on a set of unrelated machines. Uncertainty enters the model by assuming that job processing times are stochastic. In order to obtain constant factor approximation algorithms for that problem, prior work required sophisticated linear or convex programming relaxations for the assignment of jobs to machines. In contrast, we analyze a purely combinatorial, online algorithm. Maybe surprisingly, we show how to derive performance bounds for that algorithm that are of the same order of magnitude as those of earlier work, while our results are the first for an online setting. The analysis is based on dual fitting techniques. (Joint work with V. Gupta, B. Moseley, Q. Xi)
Period5 Dec 2017
Event titleAlgorithms and Uncertainty Reunion Workshop 2017
Event typeWorkshop
OrganiserUniversity of California at Berkeley
LocationBerkeley, United StatesShow on map
Degree of RecognitionInternational