A new lower bound for the single row facility layout problem
From MaRDI portal
Publication:1003774
DOI10.1016/j.dam.2008.06.002zbMath1155.90413OpenAlexW2026863487MaRDI QIDQ1003774
Publication date: 4 March 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.002
Related Items (33)
Strong mixed-integer formulations for the floor layout problem ⋮ Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ 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 ⋮ A parallel ordering problem in facilities layout ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ The corridor allocation problem ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Semidefinite relaxations of ordering problems ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ Optimal solutions for the double row 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 ⋮ An improved mixed-integer programming model for the double row layout of facilities ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ Optimal linear arrangements using betweenness variables ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ Solution Approaches for the Double-Row Equidistant Facility Layout Problem ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem
Cites Work
- Unnamed Item
- Unnamed Item
- A polyhedral approach to the single row facility layout problem
- Efficient models for the facility layout problem
- Methods for the one-dimensional space allocation problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic procedure 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
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- An Exact Approach to the One-Dimensional Facility Layout Problem
- On the One-Dimensional Space Allocation Problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- An Efficient Equipment-Layout Algorithm
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
- An r-Dimensional Quadratic Placement Algorithm
This page was built for publication: A new lower bound for the single row facility layout problem
