A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem

DOI10.1007/s10479-014-1780-6zbMath1348.90490WikidataQ59472094 ScholiaQ59472094MaRDI QIDQ338852

Mohammad Hasan, M. Dambrine

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-1780-6

zbMATH Keywords

local search; mixed integer programming; large neighborhood search; hybrid metaheuristics; machine reassignment

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• LSSPER