Fast machine reassignment

DOI10.1007/s10479-015-2082-3zbMath1348.90483OpenAlexW2282805809MaRDI QIDQ338866

Gérard Plateau, Lucas Létocart, Franck Butelle, Camille Coti, Frédéric Roupin, Roberto Wolfler Calvo, Antoine Rozenknop, Lucian Finta, Laurent Alfandari

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-2082-3

zbMATH Keywords

simulated annealinghyper-heuristicadaptive variable neighborhood searchcooperative parallel searchgeneralized assignment

Mathematics Subject Classification ID

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

Related Items

Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A simulated annealing hyper-heuristic methodology for flexible decision support
• Assignment problems: a golden anniversary survey
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• A general heuristic for vehicle routing problems
• Two- and three-dimensional parametric packing
• A survey of algorithms for the generalized assignment problem
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• A class of greedy algorithms for the generalized assignment problem
• Monte Carlo hyper-heuristics for examination timetabling
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• Two-dimensional packing problems: a survey
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• Models and algorithms for three-stage two-dimensional bin packing
• An Ejection Chain Approach for the Generalized Assignment Problem
• On Packing Two-Dimensional Bins
• Algorithms for the Multi-Resource Generalized Assignment Problem
• The Three-Dimensional Bin Packing Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• A runtime analysis of simple hyper-heuristics
• An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem
• Lower bounds and algorithms for the 2-dimensional vector packing problem