The price of anarchy for minsum related machine scheduling


Share/Save/Bookmark

Hoeksma, Ruben and Uetz, Marc (2012) The price of anarchy for minsum related machine scheduling. In: 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, September 8-9, 2011, Saarbrücken, Germany.

[img]PDF
Restricted to UT campus only
: Request a copy
143Kb
Abstract:We address the classical uniformly related machine scheduling problem with minsum objective. The problem is solvable in polynomial time by the algorithm of Horowitz and Sahni. In that solution, each machine sequences its jobs shortest first. However when jobs may choose the machine on which they are processed, while keeping the same sequencing rule per machine, the resulting Nash equilibria are in general not optimal. The price of anarchy measures this optimality gap. By means of a new characterization of the optimal solution, we show that the price of anarchy in this setting is bounded from above by 2. We also give a lower bound of e/(e-1). This complements recent results on the price of anarchy for the more general unrelated machine scheduling problem, where the price of anarchy equals 4. Interestingly, as Nash equilibria coincide with shortest processing time first (SPT) schedules, the same bounds hold for SPT schedules. Thereby, our work also fills a gap in the literature.
Item Type:Conference or Workshop Item
Copyright:© 2012 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/80764
Official URL:http://dx.doi.org/10.1007/978-3-642-29116-6_22
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page