Performance Guarantees of Local Search for Multiprocessor Scheduling

Authors:
Petra Schuurman;Tjark Vredeveld
Affiliations:
-;-
Venue:
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Year:
2001

Citing 9
Cited 8

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Analysis of a Local Search Heuristic for Facility Location Problems

Analysis of a Local Search Heuristic for Facility Location Problems
Improved Approximation of MAX-CUT on Graphs of Bounded Degree

Improved Approximation of MAX-CUT on Graphs of Bounded Degree

On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Selfish Scheduling with Setup Times

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Inner product spaces for MinSum coordination mechanisms

Proceedings of the forty-third annual ACM symposium on Theory of computing
Coordination mechanisms for selfish scheduling

WINE'05 Proceedings of the First international conference on Internet and Network Economics
A survey of approximation results for local search algorithms

Efficient Approximation and Online Algorithms
Quality of move-optimal schedules for minimizing total weighted completion time

Operations Research Letters
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of the local optima obtained by iterative improvements over the jump, the swap, and the newly defined push neighborhood.