Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs

DOI10.1016/J.EJOR.2021.11.047zbMATH Open1506.90093OpenAlexW3215124398MaRDI QIDQ2140265FDOQ2140265

Authors: Dirk Briskorn, Stefan Waldherr 

Publication date: 20 May 2022

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.047

Recommendations

• Coordination mechanisms for parallel machine scheduling
• Coordination mechanisms with hybrid local policies
• Coordination mechanisms for selfish scheduling
• Efficient coordination mechanisms for unrelated machine scheduling
• The price of anarchy for utilitarian scheduling games on related machines

zbMATH Keywords

schedulingprice of anarchydistributed schedulingcoordination mechanisms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Algorithmic Game Theory
• Worst-case equilibria
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Algorithms for Scheduling Independent Tasks
• Bounds for Certain Multiprocessing Anomalies
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Algorithmic mechanism design
• Coordination mechanisms for selfish scheduling
• Coordination mechanisms for parallel machine scheduling
• Inner product spaces for MinSum coordination mechanisms
• Approximating the throughput of multiple machines in real-time scheduling
• Solving Parallel Machine Scheduling Problems by Column Generation
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Efficient coordination mechanisms for unrelated machine scheduling
• Optimal Coordination Mechanisms for Unrelated Machine Scheduling
• Minimizing the weighted number of tardy jobs on parallel processors
• Coordination mechanisms
• Minimizing the number of tardy jobs for \(m\) parallel machines
• The Price of Anarchy in Auctions
• The Price of Anarchy for Minsum Related Machine Scheduling
• Scheduling
• Mechanism design for decentralized online machine scheduling
• HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS

Cited In (2)

• Decentralized throughput scheduling
• Coordination mechanisms for parallel machine scheduling

This page was built for publication: Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140265)