Performance guarantees of local search for multiprocessor scheduling
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1757968
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
- Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks
- Performance guarantees of local search for minsum scheduling problems
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
- Running time of local search algorithms for a scheduling problem on the parallel machines
- scientific article; zbMATH DE number 934537
- Multiprocessor scheduling by generalized extremal optimization
Cited in
(49)- Coordination mechanisms for selfish scheduling
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Coordination mechanisms for parallel machine scheduling
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Performance guarantees of local search for minsum scheduling problems
- Selfish load balancing for jobs with favorite machines
- A note on the lower bound for the price of anarchy of scheduling games on unrelated 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
- Efficient coordination mechanisms for unrelated machine scheduling
- Scheduling selfish jobs on multidimensional parallel machines
- Inefficiency of Nash equilibria with parallel processing policy
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Decentralized utilitarian mechanisms for scheduling games
- Exponential size neighborhoods for makespan minimization scheduling
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Strategic scheduling games: equilibria and efficiency
- Bounds for the convergence time of local search in scheduling problems
- Local Search Performance Guarantees for Restricted Related Parallel 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
- Performance guarantees of jump neighborhoods on restricted related parallel machines
- scientific article; zbMATH DE number 1757968 (Why is no real title available?)
- A coordination mechanism for a scheduling game with uniform-batching machines
- scientific article; zbMATH DE number 4121743 (Why is no real title available?)
- Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
- Performance guarantees for scheduling algorithms under perturbed machine speeds
- Symmetry exploitation for online machine covering with bounded migration
- A coordination mechanism for a scheduling game with parallel-batching machines
- Running time of local search algorithms for a scheduling problem on the parallel machines
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
- The Price of Anarchy on Uniformly Related Machines Revisited
- Worst-case analysis of LPT scheduling on a small number of non-identical processors
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Non-clairvoyant scheduling games
- The price of anarchy for a berth allocation game
- Nonatomic non-cooperative neighbourhood balancing 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
- The strong price of anarchy of linear bottleneck congestion games
This page was built for publication: Performance guarantees of local search for multiprocessor scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892310)
