Pages that link to "Item:Q319872"
From MaRDI portal
The following pages link to Fast local search for single row facility layout (Q319872):
Displaying 13 items.
- Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
- Design and evaluation of layout alternatives to enhance the performance of industry (Q522423) (← links)
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Exact approaches for the combined cell layout problem (Q2098024) (← links)
- Decorous combinatorial lower bounds for row layout problems (Q2189888) (← links)
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem (Q2239887) (← links)
- An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods (Q2253408) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- Construction heuristics for the single row layout problem with machine-spanning clearances (Q5884347) (← links)