A coordination mechanism for a scheduling game with parallel-batching machines

DOI10.1007/s10878-015-9980-9zbMath1409.91067OpenAlexW2228506956MaRDI QIDQ511705

Qingqin Nong, Guo-Qiang Fan, Qizhi Fang

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9980-9

zbMATH Keywords

Nash equilibriumprice of anarchycoordination mechanismscheduling game

Mathematics Subject Classification ID

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

Related Items (4)

The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ Mixed batch scheduling on identical machines ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Non-clairvoyant scheduling games
• Coordination mechanisms
• Coordination mechanisms for selfish scheduling
• Approximation algorithms in batch processing
• Scheduling with batching: A review
• The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
• Tradeoffs in worst-case equilibria
• On-line algorithms for minimizing makespan on batch processing machines
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Scheduling Independent Tasks on Uniform Processors
• 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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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
• Bounds on Multiprocessing Timing Anomalies
• Computing Nash equilibria for scheduling on restricted parallel links

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