Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1757968
- Performance guarantees of local search for multiprocessor scheduling
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Unrelated parallel machine scheduling using local search
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Running time of local search algorithms for a scheduling problem on the parallel machines
- scientific article; zbMATH DE number 934537
- scientific article; zbMATH DE number 2079761
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
- Performance guarantees of local search for minsum scheduling problems
Cited in
(10)- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- Performance guarantees of local search for minsum scheduling problems
- Exponential size neighborhoods for makespan minimization scheduling
- Performance guarantees of local search for multiprocessor scheduling
- An efficient local search with noising strategy for Google machine reassignment problem
- Performance guarantees of jump neighborhoods on restricted related parallel machines
- scientific article; zbMATH DE number 1757968 (Why is no real title available?)
- Performance guarantees for scheduling algorithms under perturbed machine speeds
- Symmetry exploitation for online machine covering with bounded migration
- Running time of local search algorithms for a scheduling problem on the parallel machines
This page was built for publication: Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557013)