The Price of Anarchy for Minsum Related Machine Scheduling

Research output: Book/ReportReportProfessional

374 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages12
Publication statusPublished - Jun 2011

Publication series

NameCTIT Technical Report Series
PublisherCentre for Telematics and Information Technology, University of Twente
ISSN (Print)1381-3625


  • IR-77623
  • METIS-277703
  • DMMP-DeCOM: Design and Complexity of Optimal Mechanisms
  • CR-G.2
  • EWI-20306
  • Price of Anarchy
  • Related Machines
  • Minsum Scheduling

Cite this