Performance guarantees of jump neighborhoods on restricted related parallel machines
From MaRDI portal
Publication:453054
DOI10.1016/J.ORL.2012.04.002zbMATH Open1247.90162OpenAlexW2121941256MaRDI QIDQ453054FDOQ453054
T. Vredeveld, P. Schuurman, D. Recalde, C. Rutten
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
Recommendations
- Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
- scientific article; zbMATH DE number 1757968
- Performance guarantees of local search for multiprocessor scheduling
- Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics
- Bounded parallel-batch scheduling on unrelated parallel machines
- scientific article; zbMATH DE number 800569
- Approximation schemes for scheduling on uniformly related and identical parallel machines
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Tight bounds for worst-case equilibria
- Scheduling unit-length jobs with machine eligibility restrictions
- Selfish load balancing
- Bounds for List Schedules on Uniform Processors
- Parallel machine scheduling with machine availability and eligibility constraints
- Title not available (Why is that?)
- Performance guarantees of local search for multiprocessor scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Scheduling parallel machines with inclusive processing set restrictions
- Tradeoffs in worst-case equilibria
- Tradeoffs and Average-Case Equilibria in Selfish Routing
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
- Structure and complexity of extreme Nash equilibria
- Computing Nash equilibria for scheduling on restricted parallel links
- Improving local search heuristics for some scheduling problems. II
Cited In (4)
- Smoothed performance guarantees for local search
- Performance guarantees of local search for minsum scheduling problems
- Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
This page was built for publication: Performance guarantees of jump neighborhoods on restricted related parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q453054)
