A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
DOI10.1007/S10479-014-1780-6zbMATH Open1348.90490OpenAlexW2139796107WikidataQ59472094 ScholiaQ59472094MaRDI QIDQ338852FDOQ338852
Authors: W. Jaśkowski, M. Szubert, P. Gawron 
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
Recommendations
- An optimization-based heuristic for the machine reassignment problem
- Heuristics and matheuristics for a real-life machine reassignment problem
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Fast machine reassignment
- Variable neighborhood search for Google machine reassignment problem
local searchhybrid metaheuristicsmixed integer programminglarge neighborhood searchmachine reassignment
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- Resource allocation algorithms for virtualized service hosting platforms
- An iterative approach for the serial batching problem with parallel machines and job families
- Matheuristics
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- A survey of very large-scale neighborhood search techniques
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Title not available (Why is that?)
- 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
- Variable neighborhood search for Google machine reassignment problem
- Hybrid metaheuristics: an introduction
- Title not available (Why is that?)
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
Cited In (4)
- An optimization-based heuristic for the machine reassignment problem
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Tuning parameters of large neighborhood search for the machine reassignment problem
- Heuristics and matheuristics for a real-life machine reassignment problem
Uses Software
This page was built for publication: A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338852)
