A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
From MaRDI portal
Publication:2239887
DOI10.1016/j.ejor.2021.02.044zbMath1487.90434OpenAlexW3133256754MaRDI QIDQ2239887
Publication date: 5 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.02.044
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A semidefinite optimization-based approach for global optimization of multi-row facility layout
- 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
- 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 approach to the single row facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- A polyhedral study of triplet formulation for single row facility layout problem
- Integrating design and production planning considerations in multi-bay manufacturing facility layout
- A new mixed integer programming formulation for facility layout design using flexible bays
- A new lower bound for the single row facility layout problem
- Improved exact approaches for row layout problems with departments of equal length
- 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
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Optimal linear arrangements using betweenness variables
- Optimal solutions for the double row layout problem
- Double-row facility layout with replicate machines and split flows
- Decorous combinatorial lower bounds for row layout problems
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- An efficient tabu algorithm for the single row facility layout problem
- New exact approaches to row layout problems
- Combining simulation and optimization for extended double row facility layout problems in factory planning
- A cutting plane algorithm for graph coloring
- 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
- Solution Approaches for the Double-Row Equidistant Facility Layout Problem
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- A survey on vertex coloring problems
- Layout design with hexagonal floor plans and material flow patterns
- The double row layout problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- A study on the spine layout for semiconductor manufacturing facility using simulated annealing
- On the One-Dimensional Space Allocation Problem
- Hospital Layout as a Quadratic Assignment Problem
- The multi-bay manufacturing facility layout problem
- Spine layout design
- Machine layout problem in modern manufacturing facilities
- A New Exact Approach to the Space-Free Double Row Layout Problem
- The checkpoint ordering problem
- An Exact Approach for the Combined Cell Layout Problem
This page was built for publication: A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
