A coordination mechanism for a scheduling game with parallel-batching machines
From MaRDI portal
Publication:511705
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; zbMATH DE number 6612292
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Coordination mechanisms for selfish scheduling
Cites work
- scientific article; zbMATH DE number 5764807 (Why is no real title available?)
- scientific article; zbMATH DE number 3708086 (Why is no real title available?)
- A linear time approximation algorithm for multiprocessor scheduling
- Approximation algorithms in batch processing
- Bounds for List Schedules on Uniform Processors
- Bounds on Multiprocessing Timing Anomalies
- Computing Nash equilibria for scheduling on restricted parallel links
- Coordination mechanisms
- Coordination mechanisms for selfish scheduling
- 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
- Non-clairvoyant scheduling games
- On-line algorithms for minimizing makespan on batch processing machines
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Performance guarantees of local search for multiprocessor scheduling
- Scheduling Independent Tasks on Uniform Processors
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling with batching: A review
- The Competitiveness of On-Line Assignments
- The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
- Tight bounds for worst-case equilibria
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Tradeoffs in worst-case equilibria
- Worst-case equilibria
Cited in
(15)- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- A coordination mechanism for a scheduling game with uniform-batching machines
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Choosing a batch to be processed
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- Mixed batch scheduling on identical machines
- scientific article; zbMATH DE number 5307174 (Why is no real title available?)
- scientific article; zbMATH DE number 6612292 (Why is no real title available?)
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- Achieving optimal backlog in multi-processor cup games
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- 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
- Optimal Coordination Mechanisms for Multi-job 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)
