A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem |
scientific article; zbMATH DE number 6648424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem |
scientific article; zbMATH DE number 6648424 |
Statements
A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (English)
0 references
7 November 2016
0 references
hybrid metaheuristics
0 references
large neighborhood search
0 references
local search
0 references
mixed integer programming
0 references
machine reassignment
0 references
0 references
0 references
0 references
0 references
0.8614593744277954
0 references
0.8541527986526489
0 references
0.8540562391281128
0 references
0.8482462167739868
0 references
0.845862627029419
0 references
