Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
SIAM Journal on Discrete Mathematics
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Local search, reducibility and approximability of NP-optimization problems
Information Processing Letters
Improving local search heuristics for some scheduling problems—I
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Improving local search heuristics for some scheduling problems. Part II
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
On Local Search for Weighted K-Set Packing
Mathematics of Operations Research
A constant factor approximation algorithm for a class of classification problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Facility Location with Nonuniform Hard Capacities
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Improved approximation algorithms for capacitated facility location problems
Mathematical Programming: Series A and B
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
Operations Research Letters
On local search for the generalized graph coloring problem
Operations Research Letters
The Price of Anarchy on Uniformly Related Machines Revisited
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximate Strong Equilibrium in Job Scheduling Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Non-clairvoyant Scheduling Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Maximizing the Minimum Load: The Cost of Selfishness
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the quality and complexity of pareto equilibria in the job scheduling game
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
Local search performance guarantees for restricted related parallel machine scheduling
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The price of anarchy on uniformly related machines revisited
Information and Computation
Coordination mechanisms for selfish parallel jobs scheduling
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Non-cooperative games on multidimensional resource allocation
Future Generation Computer Systems
Inefficiency of Nash equilibria with parallel processing policy
Information Processing Letters
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics
Theoretical Computer Science
The cost of selfishness for maximizing the minimum load on uniformly related machines
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvement over the jump, swap, multi-exchange, and the newly defined push neighborhoods. Finally, for the jump neighborhood we provide bounds on the number of local search steps required to find a local optimum.