Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions

DOI10.1016/j.ejor.2017.01.049zbMath1403.90467OpenAlexW2585086314WikidataQ115202464 ScholiaQ115202464MaRDI QIDQ1753550

Manuel V. C. Vieira, Miguel F. Anjos

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/85926082/Mathematical_Optimization_Approaches_for_Facility_Layout_Problems_The_State_of_the_Art_and_Future_Research_Directions.pdf

zbMATH Keywords

semidefinite optimizationfacilities planning and designmixed integer linear optimizationrow layoutunequal-areas facility layout

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (18)

Optimal facility layout and material handling network design ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments ⋮ Packing ovals in optimized regular polygons ⋮ Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem ⋮ Modular supervisory control for multi-floor manufacturing processes ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ Enumerating Grid Layouts of Graphs ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ An efficient variable neighborhood search for the space-free multi-row facility layout problem ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Multi-level departments-to-offices assignment with different room types ⋮ Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution ⋮ Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance ⋮ New exact approaches to row layout problems ⋮ Hybrid approach of discrete event simulation integrated with location search algorithm in a cells assignment problem: a case study ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ Exact approaches for the combined cell layout problem

Cites Work

• A semidefinite optimization-based approach for global optimization of multi-row facility layout
• Single row layout models
• A biased random-key genetic algorithm for the unequal area facility layout problem
• An improved two-stage optimization-based framework for unequal-areas 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
• A polyhedral approach to the single row facility layout problem
• Orbitopal fixing
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
• A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem
• A polyhedral study of triplet formulation for single row facility layout problem
• The multi-story space assignment problem
• Orbital branching
• An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• Efficient models for the facility layout problem
• A survey for the quadratic assignment problem
• A new mixed integer programming formulation for facility layout design using flexible bays
• Packing and partitioning orbitopes
• A new lower bound for the single row facility layout problem
• Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
• Applying ant system for solving unequal area facility layout problems
• A nonlinear optimization approach for solving facility layout problems
• Genetic algorithms, function optimization, and facility layout design
• Optimal facility layout design
• Pruning by isomorphism in branch-and-cut
• An attractor-repeller approach to floorplanning
• Exploiting orbits in symmetric ILP
• Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices.
• An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
• Generating lower bounds for the linear arrangement problem
• Optimal solutions for the double row layout problem
• The single row facility layout problem: state of the art
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• A convex optimisation framework for the unequal-areas facility layout problem
• Modified orbital branching for structured symmetry with an application to unit commitment
• Applying the sequence-pair representation to optimal facility layout designs
• 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
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Global Approaches for Facility Layout and VLSI Floorplanning
• A New Mathematical-Programming Framework for Facility-Layout Design
• Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
• Improving Discrete Model Representations via Symmetry Considerations
• The double row layout problem
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• An Exact Approach to the One-Dimensional Facility Layout Problem
• A New Lower Bound for the Minimum Linear Arrangement of a Graph
• Enhanced Model Formulations for Optimal Facility Layout
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• On Solving A One-Dimensional Space Allocation Problem With Integer Programming
• The multi-bay manufacturing facility layout problem
• Machine layout problem in modern manufacturing facilities
• Recent Progress in Modeling Unit Commitment Problems
• Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure
• One-Dimensional Space Allocation: An Ordering Algorithm

This page was built for publication: Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions