Local search performance guarantees for restricted related parallel machine scheduling

Authors:
Diego Recalde;Cyriel Rutten;Petra Schuurman;Tjark Vredeveld
Affiliations:
Department of Mathematics, Escuela Politécnica Nacional, Quito, Ecuador;Department of Quantitative Economics, Maastricht University, Maastricht, MD, The Netherlands;Sterk spel, Eindhoven, The Netherlands;Department of Quantitative Economics, Maastricht University, Maastricht, MD, The Netherlands
Venue:
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Year:
2010

Citing 12
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Tradeoffs in worst-case equilibria

Theoretical Computer Science - Approximation and online algorithms
Tight bounds for worst-case equilibria

ACM Transactions on Algorithms (TALG)
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)

Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Performance Guarantees of Local Search for Multiprocessor Scheduling

INFORMS Journal on Computing
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
The Influence of Link Restrictions on (Random) Selfish Routing

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Worst-Case Nash Equilibria in Restricted Routing

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Coordination mechanisms for selfish scheduling

Theoretical Computer Science
Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Computing Nash Equilibria for Scheduling on Restricted Parallel Links

Theory of Computing Systems
An optimal rounding gives a better approximation for scheduling unrelated machines

Operations Research Letters

Smoothed performance guarantees for local search

ESA'11 Proceedings of the 19th European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In particular, we analyze the quality of local optima with respect to the jump, swap, push and lexicographical jump neighborhood.