Performance guarantees of jump neighborhoods on restricted related parallel machines

DOI10.1016/j.orl.2012.04.002zbMath1247.90162OpenAlexW2121941256MaRDI QIDQ453054

Tjark Vredeveld, Cyriel Rutten, Petra Schuurman, Diego Recalde

Publication date: 18 September 2012

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

Full work available at URL: https://doi.org/10.1016/j.orl.2012.04.002

zbMATH Keywords

approximation algorithmsperformance guaranteejump neighborhoodsscheduling on restricted machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Smoothed performance guarantees for local search ⋮ Performance guarantees of local search for minsum scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
• Parallel machine scheduling with machine availability and eligibility constraints
• Scheduling unit-length jobs with machine eligibility restrictions
• Tradeoffs in worst-case equilibria
• Structure and complexity of extreme Nash equilibria
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Scheduling parallel machines with inclusive processing set restrictions
• Bounds for List Schedules on Uniform Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Tradeoffs and Average-Case Equilibria in Selfish Routing
• Computing Nash equilibria for scheduling on restricted parallel links
• Improving local search heuristics for some scheduling problems. II

This page was built for publication: Performance guarantees of jump neighborhoods on restricted related parallel machines