An efficient local search with noising strategy for Google machine reassignment problem

DOI10.1007/s10479-014-1686-3zbMath1348.90488OpenAlexW2072815331MaRDI QIDQ338851

Haris Gavranović, Mirsad Buljubašić

Publication date: 7 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1686-3

zbMATH Keywords

local searchmachine reassignmentnoising

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• An Ejection Chain Approach for the Generalized Assignment Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• A tabu search heuristic for the generalized assignment problem
• The noising methods: A generalization of some metaheuristics

This page was built for publication: An efficient local search with noising strategy for Google machine reassignment problem