Fast machine reassignment
From MaRDI portal
Recommendations
- An optimization-based heuristic for the machine reassignment problem
- Variable neighborhood search for Google machine reassignment problem
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Multi-neighborhood local search optimization for machine reassignment problem
- Simulated annealing for the machine reassignment problem
Cites work
- scientific article; zbMATH DE number 1728538 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- A class of greedy algorithms for the generalized assignment problem
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- A general heuristic for vehicle routing problems
- A path relinking approach with ejection chains for the generalized assignment problem
- A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- A simulated annealing hyper-heuristic methodology for flexible decision support
- A survey of algorithms for the generalized assignment problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Algorithms for the Multi-Resource Generalized Assignment Problem
- An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem
- An ejection chain approach for the generalized assignment problem
- Approximation algorithms for NP-hard problems.
- Assignment problems: a golden anniversary survey
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- Models and algorithms for three-stage two-dimensional bin packing
- Monte Carlo hyper-heuristics for examination timetabling
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- On Packing Two-Dimensional Bins
- Optimization by simulated annealing
- The Three-Dimensional Bin Packing Problem
- Two- and three-dimensional parametric packing
- Two-dimensional packing problems: a survey
Cited in
(8)- Variable neighborhood search for Google machine reassignment problem
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012
- Machine reassignment problem: the ROADEF/EURO challenge 2012
- Simulated annealing for the machine reassignment problem
- Multi-neighborhood local search optimization for machine reassignment problem
- Heuristics and matheuristics for a real-life machine reassignment problem
This page was built for publication: Fast machine reassignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338866)
