Simulated annealing for the machine reassignment problem

DOI10.1007/S10479-014-1771-7zbMath1348.90494OpenAlexW1969596020MaRDI QIDQ338857

Marcus Ritt, Leonardo Borba, Gabriel M. Portal, Luciana S. Buriol

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-1771-7

zbMATH Keywords

schedulingsimulated annealingmachine reassignment

Mathematics Subject Classification ID

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

Uses Software

• MersenneTwister

Cites Work

• Optimization by Simulated Annealing
• Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• The late acceptance hill-climbing heuristic
• Variable Neighborhood Search for Google Machine Reassignment problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Cooling Schedules for Optimal Annealing
• Mersenne twister
• Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
• Heuristics and matheuristics for a real‐life machine reassignment problem

This page was built for publication: Simulated annealing for the machine reassignment problem