Sequential scheduling on identical machines

DOI10.1016/j.orl.2015.08.003zbMath1408.90130OpenAlexW1632220501MaRDI QIDQ1785424

Uri Yovel, Refael Hassin

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.08.003

zbMATH Keywords

machine schedulingcongestion gamesload balancingmakespan minimizationsubgame-perfect equilibriumsequential price of anarchy

Mathematics Subject Classification ID

Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

The quality of equilibria for set packing and throughput scheduling games ⋮ Tight bounds for the price of anarchy and stability in sequential transportation games ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• The curse of simultaneity
• Some Anomalies of Farsighted Strategic Behavior
• Decentralized Throughput Scheduling
• On the Sequential Price of Anarchy of Isolation Games
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential scheduling on identical machines