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

DOI10.1007/S10479-014-1780-6MaRDI QIDQ338852zbMATH OpenOpenAlexWikidataFDO

Authors W. Jaśkowski, M. Szubert, P. Gawron

Publication date 7 November 2016

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10479-014-1780-6

zbMATH Keywords

local searchhybrid metaheuristicsmixed integer programminglarge neighborhood searchmachine reassignment

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1305407 (Why is no real title available?)
• scientific article; zbMATH DE number 2243399 (Why is no real title available?)
• 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
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• An iterative approach for the serial batching problem with parallel machines and job families
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Hybrid metaheuristics: an introduction
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Matheuristics
• Resource allocation algorithms for virtualized service hosting platforms
• Variable neighborhood search for Google machine reassignment problem

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

Describes a project that uses

Uses Software

• LSSPER

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)