An optimization-based heuristic for the machine reassignment problem

DOI10.1007/s10479-015-2002-6zbMath1348.90492OpenAlexW1712873981MaRDI QIDQ338859

Mehdi Mrad, Mohamed Haouari, Anis Gharbi, 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

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

Cites Work

• Unnamed Item
• An optimization-based heuristic for the robotic cell problem
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• Effective algorithm and heuristic for the generalized assignment problem.
• A class of greedy algorithms for the generalized assignment problem
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• A path relinking approach with ejection chains for the generalized assignment problem
• An Optimization Based Heuristic for Political Districting
• Variable Neighborhood Search for Google Machine Reassignment problem
• An Ejection Chain Approach for the Generalized Assignment Problem
• A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
• Tight bounds for the identical parallel machine scheduling problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• An MDD Approach to Multidimensional Bin Packing
• Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
• Lower bounds and algorithms for the 2-dimensional vector packing problem

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