Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines

DOI10.1016/j.endm.2006.06.058zbMath1134.68321OpenAlexW2011117908MaRDI QIDQ3439462

Gerhard J. Woeginger, Tjark Vredeveld, Tobias Brueggemann, Johann L. Hurink

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.058

zbMATH Keywords

parallel machineslocal searchmakespanperformance guaranteevery large-scale neighborhood

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Split-merge: using exponential neighborhood search for scheduling a batching machine

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• Quality of move-optimal schedules for minimizing total weighted completion time
• A linear time approximation algorithm for multiprocessor scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines