The single row facility layout problem: state of the art

DOI10.1007/S12597-012-0091-4zbMath1260.90004OpenAlexW2105866213MaRDI QIDQ1947218

Ravi Kothari, Diptesh Ghosh

Publication date: 12 April 2013

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://web.iima.ac.in/assets/snippets/workingpaperpdf/7736113342011-12-02.pdf

zbMATH Keywords

heuristicsexact algorithmsformulationbenchmark instancesliterature reviewsingle row facility layout problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (16)

Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Analysis of facility layout alternatives using proposed integrated approach ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Design and evaluation of layout alternatives to enhance the performance of industry ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Integer programming for urban design ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• A computational study and survey of methods for the single-row facility layout problem
• Semidefinite relaxations of ordering problems
• A polyhedral approach to the single row facility layout problem
• Single row facility layout problem using a permutation-based genetic algorithm
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• Efficient models for the facility layout problem
• Methods for the one-dimensional space allocation problem
• A new lower bound for the single row facility layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• A heuristic procedure for the single-row facility layout problem
• An ant algorithm for the single row layout problem in flexible manufacturing systems
• An efficient tabu algorithm for the single row facility layout problem
• On the exact solution of a facility layout problem
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
• An Exact Approach to the One-Dimensional Facility Layout Problem
• Provably near-optimal solutions for very large single-row facility layout problems
• 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
• Experiments on the minimum linear arrangement problem
• One-Dimensional Space Allocation: An Ordering Algorithm
• Optimal Assignments of Numbers to Vertices

This page was built for publication: The single row facility layout problem: state of the art