Pages that link to "Item:Q2840775"
From MaRDI portal
The following pages link to Variable neighborhood search for Google machine reassignment problem (Q2840775):
Displaying 9 items.
- Machine reassignment problem: the ROADEF/EURO challenge 2012 (Q338848) (← links)
- An efficient local search with noising strategy for Google machine reassignment problem (Q338851) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- Simulated annealing for the machine reassignment problem (Q338857) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Fast machine reassignment (Q338866) (← links)
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- Heuristics and matheuristics for a real‐life machine reassignment problem (Q5246825) (← links)