A heuristic procedure for the single-row facility layout problem
From MaRDI portal
Recommendations
- An efficient tabu algorithm for the single row facility layout problem
- The single row facility layout problem: state of the art
- A GRASP algorithm for solving large-scale single row facility layout problems
- A hybrid heuristic for the facilities layout problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
Cites work
- scientific article; zbMATH DE number 3339970 (Why is no real title available?)
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- An r-Dimensional Quadratic Placement Algorithm
- An Efficient Equipment-Layout Algorithm
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An exact algorithm for the general quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Deux problèmes d'affectation non linéaires
- Efficient models for the facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- Finite-State Processes and Dynamic Programming
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- Multiple objective programming for the quadratic assignment problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- On the One-Dimensional Space Allocation Problem
- One-Dimensional Space Allocation: An Ordering Algorithm
- Optimal Linear Ordering
- Quadratic assignment problems
- Recent models and techniques for solving the layout problem
- Solving quadratic assignment problems with rectangular distances and integer programming
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- The facility layout problem
- The quadratic assignment problem
Cited in
(19)- Provably near-optimal solutions for very large single-row facility layout problems
- A GRASP algorithm for solving large-scale single row facility layout problems
- The double row layout problem
- Insertion based Lin-Kernighan heuristic for single row facility layout
- A computational study and survey of methods for the single-row facility layout problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Single row facility layout problem using a permutation-based genetic algorithm
- A polyhedral study of triplet formulation for single row facility layout problem
- An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: the case of injection process with ambiguous data
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- A new lower bound for the single row facility layout problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Global approaches for facility layout and VLSI floorplanning
- The single row facility layout problem: state of the art
- An efficient tabu algorithm for the single row facility layout problem
- An efficient genetic algorithm for single row facility layout
- On the exact solution of a facility layout problem
- The constrained single-row facility layout problem with repairing mechanisms
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
This page was built for publication: A heuristic procedure for the single-row facility layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390259)
