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

DOI10.1007/S10878-015-9980-9zbMATH Open1409.91067OpenAlexW2228506956MaRDI QIDQ511705FDOQ511705

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

Recommendations

• The shortest first coordination mechanism for a scheduling game with parallel-batching machines
• A coordination mechanism for a scheduling game with uniform-batching machines
• scientific article
• Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
• Coordination mechanisms for selfish scheduling

zbMATH Keywords

Nash equilibriumprice of anarchycoordination mechanismscheduling game

Mathematics Subject Classification ID

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

Cites Work

• Worst-case equilibria
• Scheduling with batching: A review
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Tight bounds for worst-case equilibria
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• The Competitiveness of On-Line Assignments
• Bounds on Multiprocessing Timing Anomalies
• Approximation algorithms in batch processing
• On-line algorithms for minimizing makespan on batch processing machines
• Scheduling Independent Tasks on Uniform Processors
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Coordination mechanisms for selfish scheduling
• Bounds for List Schedules on Uniform Processors
• Scheduling a single batch processing machine with non-identical job sizes
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Computing Nash equilibria for scheduling on restricted parallel links
• Non-clairvoyant scheduling games
• Performance guarantees of local search for multiprocessor scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Title not available (Why is that?)
• Coordination mechanisms
• Tradeoffs in worst-case equilibria
• The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
• Title not available (Why is that?)

Cited In (14)

• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Achieving optimal backlog in multi-processor cup games
• Choosing a batch to be processed
• A parallel machine schedule updating game with compensations and clients averse to uncertain loss
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
• Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines
• Mixed batch scheduling on identical machines
• Title not available (Why is that?)
• Coordination mechanisms for scheduling selfish jobs with favorite machines
• Scheduling games with machine-dependent priority lists
• Title not available (Why is that?)
• Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games

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

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