Variable Neighborhood Search for Google Machine Reassignment problem
From MaRDI portal
Publication:2840775
DOI10.1016/j.endm.2012.10.028zbMath1268.90145OpenAlexW2030286210MaRDI QIDQ2840775
Haris Gavranović, Mirsad Buljubašić, Emir Demirović
Publication date: 23 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.028
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ Simulated annealing for the machine reassignment problem ⋮ An optimization-based heuristic for the machine reassignment problem ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ Heuristics and matheuristics for a real‐life machine reassignment problem
Cites Work
- Variable neighbourhood search: methods and applications
- 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: Variable Neighborhood Search for Google Machine Reassignment problem