A GRASP algorithm for solving large-scale single row facility layout problems
From MaRDI portal
Publication:1734823
Recommendations
- The single row facility layout problem: state of the art
- A computational study and survey of methods for the single-row facility layout problem
- Provably near-optimal solutions for very large single-row facility layout problems
- A polyhedral approach to the single row facility layout problem
- A heuristic procedure for the single-row facility layout problem
- A new lower bound for the single row facility layout problem
- An efficient tabu algorithm for the single row facility layout problem
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Optimisation of complex and large-sized single-row facility layout problems with a unique hybrid meta-heuristic framework
Cites work
- A computational study and survey of methods for the single-row facility layout problem
- A new lower bound for the single row facility layout problem
- A polyhedral approach to the single row facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient tabu algorithm for the single row facility layout problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
- Efficient models for the facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Fast local search for single row facility layout
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the exact solution of a facility layout problem
- On the One-Dimensional Space Allocation Problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Provably near-optimal solutions for very large single-row facility layout problems
- Single row facility layout problem using a permutation-based genetic algorithm
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- The single row facility layout problem: state of the art
Cited in
(13)- A heuristic procedure for the single-row facility layout problem
- A decomposition-based algorithm for the double row layout problem
- Exact approaches for the combined cell layout problem
- Decorous combinatorial lower bounds for row layout problems
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- An efficient genetic algorithm for single row facility layout
- Optimisation of complex and large-sized single-row facility layout problems with a unique hybrid meta-heuristic framework
- GRASP with path-relinking for facility layout
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- Provably near-optimal solutions for very large single-row facility layout problems
- A fast local search based memetic algorithm for the parallel row ordering problem
- A matheuristic for solving the single row facility layout problem
- An efficient memetic algorithm for the corridor allocation problem
This page was built for publication: A GRASP algorithm for solving large-scale single row facility layout problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734823)
