An optimization-based heuristic for the machine reassignment problem

DOI10.1007/S10479-015-2002-6MaRDI QIDQ338859zbMATH OpenOpenAlexFDO

Authors Mehdi Mrad, Anis Gharbi, Mohamed Haouari, Mohamed Kharbeche

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-015-2002-6

zbMATH Keywords

mixed integer programmingmachine reassignmentoptimization-based heuristic

Mathematics Subject Classification ID

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

Recommendations

• Heuristics and matheuristics for a real-life machine reassignment problem
• A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
• Simulated annealing for the machine reassignment problem
• Reoptimization in machine scheduling
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
• Multi-neighborhood local search optimization for machine reassignment problem
• Publication:4865151
• Metaheuristics for the integrated machine allocation and layout problem
• Heuristics for the multi-resource generalized assignment problem

Cites work

• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• A class of greedy algorithms for the generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• A set-covering-based heuristic approach for bin-packing problems
• An MDD approach to multidimensional bin packing
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
• An ejection chain approach for the generalized assignment problem
• An optimization based heuristic for political districting
• An optimization-based heuristic for the robotic cell problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The generalized assignment problem
• Tight bounds for the identical parallel machine scheduling problem
• Tuning parameters of large neighborhood search for the machine reassignment problem
• Variable neighborhood search for Google machine reassignment problem

Cited in

(11)

• Metaheuristics for the integrated machine allocation and layout problem
• Variable neighborhood search for Google machine reassignment problem
• Optimality Regions and Penalty Analysis of the Parameter Space for Machine Replacement Problems
• Tuning parameters of large neighborhood search for the machine reassignment problem
• A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
• Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
• Fast machine reassignment
• Machine reassignment problem: the ROADEF/EURO challenge 2012
• Simulated annealing for the machine reassignment problem
• Multi-neighborhood local search optimization for machine reassignment problem
• Heuristics and matheuristics for a real-life machine reassignment problem

This page was built for publication: An optimization-based heuristic for the machine reassignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338859)