Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

DOI10.1002/nav.21497zbMath1407.90149OpenAlexW2076551060WikidataQ65553902 ScholiaQ65553902MaRDI QIDQ3120568

José R. Correa, Maurice Queyranne

Publication date: 5 March 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/127135

zbMATH Keywords

game theoryschedulingcombinatorial optimization

Mathematics Subject Classification ID

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

Related Items (9)

A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Operational Research in the Wine Supply Chain ⋮ Inefficiency of games with social context ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Scheduling games with machine-dependent priority lists ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Performance guarantees of local search for minsum scheduling problems

This page was built for publication: Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost