Pages that link to "Item:Q2253408"
From MaRDI portal
The following pages link to Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods (Q2253408):
Displaying 19 items.
- Single row layout models (Q319651) (← links)
- Fast local search for single row facility layout (Q319872) (← links)
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem (Q320805) (← links)
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm (Q337195) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Insertion based Lin-Kernighan heuristic for single row facility layout (Q339556) (← links)
- Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments (Q1652644) (← links)
- A GRASP algorithm for solving large-scale single row facility layout problems (Q1734823) (← links)
- A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation (Q1792742) (← 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)
- An efficient tabu algorithm for the single row facility layout problem (Q2270298) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem (Q2668724) (← links)
- Construction heuristics for the single row layout problem with machine-spanning clearances (Q5884347) (← links)
- Iterated local search with ejection chains for the space-free multi-row facility layout problem (Q6565430) (← links)
