Bounds for the Convergence Time of Local Search in Scheduling Problems

DOI10.1007/978-3-662-54110-4_24zbMath1414.90148OpenAlexW2559906574MaRDI QIDQ2959840

Tobias Brunsch, Michael Etscheid, Heiko Röglin

Publication date: 10 February 2017

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54110-4_24

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Smoothed performance guarantees for local search
• Coordination mechanisms for selfish scheduling
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
• A class of games possessing pure-strategy Nash equilibria
• Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Smoothed analysis of algorithms
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Automata, Languages and Programming
• Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
• Random knapsack in expected polynomial time
• Improving local search heuristics for some scheduling problems. II

This page was built for publication: Bounds for the Convergence Time of Local Search in Scheduling Problems