Decorous combinatorial lower bounds for row layout problems
From MaRDI portal
Publication:2189888
DOI10.1016/j.ejor.2020.04.010zbMath1443.90238OpenAlexW3017041353MaRDI QIDQ2189888
Mirko Dahlbeck, Anja Fischer, Frank Fischer
Publication date: 17 June 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.04.010
Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem, Mathematical optimization approach for facility layout on several rows, Exact approaches for the combined cell layout problem
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
- 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
- A branch-and-bound algorithm for the single-row equidistant facility layout problem
- Single row facility layout problem using a permutation-based genetic algorithm
- Efficient models for the facility layout problem
- A survey for the quadratic assignment problem
- A new lower bound for the single row facility layout problem
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Improved exact approaches for row layout problems with departments of equal length
- Fast simulated annealing for single-row equidistant 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
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Directional decomposition heuristic for a linear machine-cell location problem.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Generating lower bounds for the linear arrangement problem
- Optimal solutions for the double row layout problem
- A decomposition-based algorithm for the double row layout problem
- Double-row facility layout with replicate machines and split flows
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- 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
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Global Approaches for Facility Layout and VLSI Floorplanning
- Solution Approaches for the Double-Row Equidistant Facility Layout Problem
- Decorous Lower Bounds for Minimum Linear Arrangement
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- 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 New Lower Bound for the Minimum Linear Arrangement of a Graph
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- Hospital Layout as a Quadratic Assignment Problem
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- 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
- Solution of a Large-Scale Traveling-Salesman Problem
- Optimal numberings and isoperimetric problems on graphs
- Optimal Assignments of Numbers to Vertices
- Matroids and the greedy algorithm
