On November 4, 2015, Michael Etscheid (University of Bonn) will give a talk about "Bounds for the Convergence Time of Local Search in Scheduling Problems" in the context of the SFB 901.
Abstract:
We study the convergence time of local search for a standard machine scheduling problem in which jobs are assigned to identical or related machines. Local search corresponds to the best response dynamics that arises when jobs selfishly try to minimize their costs. We assume that each machine runs a coordination mechanism that determines the order of execution of jobs assigned to it. We obtain various new polynomial and pseudo-polynomial bounds for the well-studied coordination mechanisms Makespan and Shortest-Job-First, using worst-case and smoothed analysis. We also introduce a natural coordination mechanism FIFO, which takes into account the order in which jobs arrive at a machine, and study both its impact on the convergence time and its price of anarchy.
This is joint work with Tobias Brunsch and Heiko Röglin.