Coordination mechanisms for parallel machine scheduling
From MaRDI portal
Recommendations
- Coordination mechanisms for selfish scheduling
- Coordination mechanisms with hybrid local policies
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Coordination mechanisms from (almost) all scheduling policies
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
Cites work
- scientific article; zbMATH DE number 5764807 (Why is no real title available?)
- scientific article; zbMATH DE number 2119691 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A linear time approximation algorithm for multiprocessor scheduling
- A strongly polynomial algorithm for the transportation problem
- Bounds for Certain Multiprocessing Anomalies
- Bounds for List Schedules on Uniform Processors
- Coordination mechanisms
- Coordination mechanisms for selfish scheduling
- Coordination mechanisms with hybrid local policies
- Efficient coordination mechanisms for unrelated machine scheduling
- Faster algorithms for the shortest path problem
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Inner product spaces for minsum coordination mechanisms
- Nash equilibria in competitive project scheduling
- New approximation bounds for LPT scheduling
- 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
- Promoting cooperation in selfish computational grids
- Scheduling Independent Tasks on Uniform Processors
- The Competitiveness of On-Line Assignments
- Tight Bounds for Selfish and Greedy Load Balancing
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Cited in
(13)- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- Coordination mechanisms for scheduling games with proportional deterioration
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Cooperation in one machine scheduling
- Pareto-optimal algorithms for scheduling games on parallel-batching machines with activation cost
- Implementation of optimal schedules in outsourcing with identical suppliers
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- The price of multi-organization constraint in unrelated parallel machine scheduling
- Nonpreemptive coordination mechanisms for identical machines
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II
- Coordination mechanisms with hybrid local policies
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
This page was built for publication: Coordination mechanisms for parallel machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926738)