Heuristics and matheuristics for a real‐life machine reassignment problem

DOI10.1111/itor.12063zbMath1309.90043OpenAlexW2051877214MaRDI QIDQ5246825

Vitor A. A. Souza, Vinicius Morais, Ramon Lopes, Thiago F. Noronha

Publication date: 22 April 2015

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12063

zbMATH Keywords

heuristicsiterated local searchmachine reassignment problemlinear integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Simulated annealing for the machine reassignment problem ⋮ Vector bin packing with heterogeneous bins: application to the machine reassignment problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem

Uses Software

• PERL
• TTTPLOTS

Cites Work

• Approximation algorithms for time constrained scheduling
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
• Heuristics and lower bounds for the bin packing problem with conflicts
• Iterated local search for the quadratic assignment problem
• Variable Neighborhood Search for Google Machine Reassignment problem
• Algorithms for the Multi-Resource Generalized Assignment Problem
• Variable neighborhood search: Principles and applications

This page was built for publication: Heuristics and matheuristics for a real‐life machine reassignment problem