A heuristic procedure for the single-row facility layout problem
From MaRDI portal
Publication:1390259
DOI10.1016/0377-2217(94)00062-HzbMath0914.90201MaRDI QIDQ1390259
George C. Hadjinicola, K. Ravi Kumar, Ting-li Lin
Publication date: 14 July 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ The double row layout problem ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ The single row facility layout problem: state of the art ⋮ An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: the case of injection process with ambiguous data ⋮ An efficient genetic algorithm for single row facility layout ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ On the exact solution of a facility layout problem ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions
Cites Work
- Unnamed Item
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- Quadratic assignment problems
- Efficient models for the facility layout problem
- An exact algorithm for the general quadratic assignment problem
- The facility layout problem
- Recent models and techniques for solving the layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- The Quadratic Assignment Problem
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- Assignment Problems and the Location of Economic Activities
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Multiple objective programming for the quadratic assignment problem
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- On the One-Dimensional Space Allocation Problem
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- Solving quadratic assignment problems with rectangular distances and integer programming
- An Efficient Equipment-Layout Algorithm
- Optimal Linear Ordering
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- An r-Dimensional Quadratic Placement Algorithm
