Simulated annealing for the machine reassignment problem
type: Item
instance of: scholarly article
title: Simulated annealing for the machine reassignment problem
zbMATH Open document ID: 1348.90494
author: Gabriel M. Portal
author: Marcus Ritt
author: Leonardo Borba
author: Luciana Buriol
published in: Annals of Operations Research
publication date: 2016-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6648426
zbMATH Keywords: machine reassignment
zbMATH Keywords: scheduling
zbMATH Keywords: simulated annealing
describes a project that uses: MersenneTwister
MaRDI profile type: Publication
full work available at URL: s10479-014-1771-7
OpenAlex ID: W1969596020
cites work: Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
cites work: The late acceptance hill-climbing heuristic
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Variable neighborhood search for Google machine reassignment problem
cites work: Mersenne twister
cites work: Cooling Schedules for Optimal Annealing
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing
cites work: Heuristics and matheuristics for a real‐life machine reassignment problem
cites work: Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
DOI: 10.1007/S10479-014-1771-7
description: scientific article; zbMATH DE number 6648426