Local search for multiprocessor scheduling: how many moves does it take to a local optimum?

DOI10.1016/S0167-6377(02)00212-2zbMath1088.90024OpenAlexW2100971459MaRDI QIDQ1413905

Tjark Vredeveld, Cor A. J. Hurkens

Publication date: 17 November 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00212-2

zbMATH Keywords

job interchange algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Exponential size neighborhoods for makespan minimization scheduling ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ Performance guarantees of jump neighborhoods on restricted related parallel machines ⋮ Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines

Cites Work

• A linear time approximation algorithm for multiprocessor scheduling
• Improving local search heuristics for some scheduling problems. II
• Unnamed Item
• Unnamed Item

This page was built for publication: Local search for multiprocessor scheduling: how many moves does it take to a local optimum?