Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem

DOI10.1007/978-3-642-38171-3_12zbMath1382.68227OpenAlexW189470725MaRDI QIDQ4922911

Helmut Simonis, Barry O'Sullivan, Deepak Mehta, Yuri Malitsky

Publication date: 4 June 2013

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38171-3_12

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Machine reassignment problem: the ROADEF/EURO challenge 2012 ⋮ Simulated annealing for the machine reassignment problem ⋮ An optimization-based heuristic for the machine reassignment problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ Explanation-based large neighborhood search ⋮ PyDGGA: distributed GGA for automatic configuration

This page was built for publication: Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem