A new lower bound for the single row facility layout problem
- 23 July 2008
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (1), 183-190
- https://doi.org/10.1016/j.dam.2008.06.002
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting PlanesINFORMS Journal on Computing, 2008
- An Exact Approach to the One-Dimensional Facility Layout ProblemOperations Research, 2008
- On the exact solution of a facility layout problemEuropean Journal of Operational Research, 2006
- A semidefinite optimization approach for the single-row layout problem with unequal dimensionsDiscrete Optimization, 2005
- A new heuristic procedure for the single-row facility layout problemInternational Journal of Computer Integrated Manufacturing, 2001
- A heuristic procedure for the single-row facility layout problemEuropean Journal of Operational Research, 1995
- Experimental analysis of simulated annealing based algorithms for the layout problemEuropean Journal of Operational Research, 1992
- Efficient models for the facility layout problemEuropean Journal of Operational Research, 1991
- Methods for the one-dimensional space allocation problemComputers & Operations Research, 1990
- Finite-State Processes and Dynamic ProgrammingSIAM Journal on Applied Mathematics, 1967