A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis

DOI10.1016/j.ejor.2018.08.024zbMath1403.90653OpenAlexW2185036851MaRDI QIDQ1622818

Jac Braat, Herbert Hamers, Marco Slikker, Flip Klijn

Publication date: 19 November 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10261/173859

zbMATH Keywords

game theoryequilibriumheuristicoutsourcingsequencing situations

Mathematics Subject Classification ID

Applications of game theory (91A80) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Outsourcing with identical suppliers and shortest-first policy: a laboratory experiment ⋮ Magnitude of inefficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coordination mechanisms for selfish scheduling
• Coordination mechanisms for scheduling games with proportional deterioration
• Coordination mechanisms for parallel machine scheduling
• Decentralized utilitarian mechanisms for scheduling games
• Non-cooperative games
• The Price of Anarchy for Minsum Related Machine Scheduling
• Bounding the Inefficiency of Altruism through Social Contribution Games
• The Price of Anarchy in Supply Chains: Quantifying the Efficiency of Price-Only Contracts
• Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis