A mixed-integer programming formulation for optimizing the double row layout problem
From MaRDI portal
Publication:6661116
DOI10.1080/10556788.2024.2349093MaRDI QIDQ6661116
Publication date: 10 January 2025
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Cites Work
- A parallel ordering problem in facilities layout
- The corridor allocation problem
- Efficient models for the facility layout problem
- A new lower bound for the single row facility layout problem
- Improved exact approaches for row layout problems with departments of equal length
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- 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
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- New exact approaches to row layout problems
- On the exact solution of a facility layout problem
- The double row layout problem
- An Exact Approach to the One-Dimensional Facility Layout Problem
- Facets of the linear ordering polytope
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
This page was built for publication: A mixed-integer programming formulation for optimizing the double row layout problem
