A heuristic procedure for the layout of a large number of facilities
Management Science
Integer and combinatorial optimization
Integer and combinatorial optimization
Machine layout problem in flexible manufacturing systems
Operations Research
Methods for the one-dimensional space allocation problem
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Provably near-optimal solutions for very large single-row facility layout problems
Optimization Methods & Software - GLOBAL OPTIMIZATION
A particle swarm optimization for the single row facility layout problem
Computers and Industrial Engineering
Note: A polyhedral study of triplet formulation for single row facility layout problem
Discrete Applied Mathematics
Insertion based Lin-Kernighan heuristic for single row facility layout
Computers and Operations Research
A computational study and survey of methods for the single-row facility layout problem
Computational Optimization and Applications
Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem
Computers and Industrial Engineering
Exact Approaches to Multilevel Vertical Orderings
INFORMS Journal on Computing
A parallel ordering problem in facilities layout
Computers and Operations Research
A scatter search algorithm for the single row facility layout problem
Journal of Heuristics
| Hi-index | 0.04 |
Single row facility layout is the NP-hard problem of arranging n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. In this paper, we define a polytope associated to the problem and present a partial linear description whose integral points are the incidence vectors of a layout. We propose a new lower bound for the problem by optimizing a linear program over the partial description given and using some valid inequalities, which are introduced here, as cutting planes. Several instances from the literature as well as new large instances with size n=33 and n=35 are considered in the computational tests. For all the instances tested, the proposed lower bound achieves the cost of an optimal layout within reasonable computing time.