An efficient local search with noising strategy for Google machine reassignment problem
From MaRDI portal
Recommendations
- Variable neighborhood search for Google machine reassignment problem
- Multi-neighborhood local search optimization for machine reassignment problem
- Justification-Based Local Search with Adaptive Noise Strategies
- Tuning parameters of large neighborhood search for the machine reassignment problem
- An empirical study of optimal noise and runtime distributions in local search
- Understanding the role of noise in stochastic local search: analysis and experiments
- Noisy optimization complexity under locality assumption
- Lazy local search meets machine scheduling
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
Cites work
- A tabu search heuristic for the generalized assignment problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- An ejection chain approach for the generalized assignment problem
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- The noising methods: A generalization of some metaheuristics
Cited in
(2)
This page was built for publication: An efficient local search with noising strategy for Google machine reassignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338851)
