The shortest first coordination mechanism for a scheduling game with parallel-batching machines

DOI10.1007/s40305-016-0134-2zbMath1365.90143OpenAlexW2523856341MaRDI QIDQ2361588

Sai-Jun Guo, Qingqin Nong, Li-Hui Miao

Publication date: 30 June 2017

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0134-2

zbMATH Keywords

schedulingNash equilibriumgameprice of anarchycoordination mechanism

Mathematics Subject Classification ID

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

Related Items (2)

Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coordination mechanism for a scheduling game with parallel-batching machines
• Coordination mechanisms for selfish scheduling
• Scheduling with batching: A review
• Tradeoffs in worst-case equilibria
• On-line algorithms for minimizing makespan on batch processing machines
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Scheduling Independent Tasks on Uniform Processors
• Non-clairvoyant Scheduling Games
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Bounds for List Schedules on Uniform Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Scheduling a single batch processing machine with non-identical job sizes
• Automata, Languages and Programming
• Bounds on Multiprocessing Timing Anomalies
• Computing Nash equilibria for scheduling on restricted parallel links

This page was built for publication: The shortest first coordination mechanism for a scheduling game with parallel-batching machines