Optimal solutions for the double row layout problem
From MaRDI portal
Publication:1940444
DOI10.1007/s11590-011-0426-8zbMath1267.90116OpenAlexW2068055354MaRDI QIDQ1940444
Publication date: 7 March 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0426-8
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Related Items (13)
A parallel ordering problem in facilities layout ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ An improved mixed-integer programming model for the double row layout of facilities ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ A decomposition-based algorithm for the double row 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 ⋮ Double-row facility layout with replicate machines and split flows ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem
Cites Work
- A polyhedral approach to the single row facility layout problem
- Facets of the clique partitioning polytope
- Efficient models for the facility layout problem
- A new lower bound for the single row facility layout problem
- A cutting plane algorithm for a clustering problem
- Experimental analysis of simulated annealing based algorithms for the 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
- Multiprocessor scheduling under precedence constraints: polyhedral results
- 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
- The double row layout problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Enhanced Model Formulations for Optimal Facility Layout
- Facets of the linear ordering polytope
- On the One-Dimensional Space Allocation Problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: Optimal solutions for the double row layout problem
