A linear time approximation algorithm for multiprocessor scheduling
From MaRDI portal
Cites work
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds on Multiprocessing Timing Anomalies
- Extensions of Forsythe's Method for Random Sampling from the Normal Distribution
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3521517 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 3635458 (Why is no real title available?)
Cited in
(58)- Coordination mechanisms for selfish scheduling
- Improved 0/1-interchange scheduling
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
- The price of anarchy and stability in general noisy best-response dynamics
- Local search for the minimum label spanning tree problem with bounded color classes.
- Coordination mechanisms for parallel machine scheduling
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- On the price of anarchy of two-stage machine scheduling games
- Tighter price of anarchy for selfish task allocation on selfish machines
- Performance guarantees of local search for minsum scheduling problems
- Selfish load balancing for jobs with favorite machines
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Scheduling selfish jobs on multidimensional parallel machines
- Inefficiency of Nash equilibria with parallel processing policy
- Minimizing labor requirements in a periodic vehicle loading problem
- Decentralized utilitarian mechanisms for scheduling games
- Structure and complexity of extreme Nash equilibria
- Worst-case Nash equilibria in restricted routing
- Exponential size neighborhoods for makespan minimization scheduling
- Strategic scheduling games: equilibria and efficiency
- Bounds for the convergence time of local search in scheduling problems
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
- Optimal coordination mechanisms for unrelated machine scheduling
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- Maximizing the minimum load: the cost of selfishness
- Reducing price of anarchy of selfish task allocation with more selfishness
- Smoothed performance guarantees for local search
- The price of anarchy on uniformly related machines revisited
- Machine scheduling models in environmentally focused chemical manufacturing
- Performance guarantees of jump neighborhoods on restricted related parallel machines
- A coordination mechanism for a scheduling game with uniform-batching machines
- Strong stability of Nash equilibria in load balancing games
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
- A coordination mechanism for a scheduling game with parallel-batching machines
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
- A composite algorithm for multiprocessor scheduling
- The Price of Anarchy on Uniformly Related Machines Revisited
- Approximate Strong Equilibrium in Job Scheduling Games
- Load rebalancing games in dynamic systems with migration costs
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Scheduling games with rank-based utilities
- Non-clairvoyant scheduling games
- The price of anarchy for a berth allocation game
- Sequential solutions in machine scheduling games
- Scheduling games with potential penalties on the move of jobs
- A k-swap local search for makespan scheduling
- Price of anarchy of scheduling games on hierarchical machines with quadratic social cost
- Smoothed analysis of the k-swap neighborhood for makespan scheduling
- Inefficiency of multiplicative approximate Nash equilibrium for scheduling games
- Inefficiency of equilibria for the machine covering game on uniform machines
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Lower bounds and heuristic algorithms for the k_i-partitioning problem
- Partial solutions and multifit algorithm for multiprocessor scheduling
- The strong price of anarchy of linear bottleneck congestion games
- A state-of-the-art review of parallel-machine scheduling research
- Price of anarchy in parallel processing
This page was built for publication: A linear time approximation algorithm for multiprocessor scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048240)
