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

DOI10.1007/s10479-014-1780-6zbMath1348.90490OpenAlexW2139796107WikidataQ59472094 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 searchmixed integer programminglarge neighborhood searchhybrid metaheuristicsmachine reassignment

Mathematics Subject Classification ID

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

Uses Software

• LSSPER

Cites Work

• Unnamed Item
• Unnamed Item
• An iterative approach for the serial batching problem with parallel machines and job families
• Resource allocation algorithms for virtualized service hosting platforms
• A survey of very large-scale neighborhood search techniques
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Variable Neighborhood Search for Google Machine Reassignment problem
• Hybrid Metaheuristics: An Introduction
• Matheuristics