Exact approaches for the combined cell layout problem

DOI10.1016/J.EJOR.2022.04.031MaRDI QIDQ2098024zbMATH OpenOpenAlexFDO

Authors Mirko Dahlbeck, Anja Fischer, Frank Fischer, Philipp Hungerländer, Kerstin Maier

Publication date 17 November 2022

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

Full work available at URL https://doi.org/10.1016/j.ejor.2022.04.031

zbMATH Keywords

facility planning and designexact approachescombined cell layout problemmulti-bay layout problempier-type material flow pattern

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• An exact approach for the combined cell layout problem
• New exact approaches to row layout problems
• On the exact solution of a facility layout problem
• A new exact approach to the space-free double row layout problem
• Improved exact approaches for row layout problems with departments of equal length

Cites work

• A GRASP algorithm for solving large-scale single row facility layout problems
• A computational study and survey of methods for the single-row facility layout problem
• A decomposition-based algorithm for the double row layout problem
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
• A new lower bound for the single row facility layout problem
• A new mixed integer programming formulation for facility layout design using flexible bays
• A parallel ordering problem in facilities layout
• A polyhedral approach to the single row facility layout problem
• A polyhedral study of triplet formulation for single row facility layout problem
• An Exact Approach to the One-Dimensional Facility Layout Problem
• An efficient tabu algorithm for the single row facility layout problem
• An exact approach for the combined cell layout problem
• An improved mixed-integer programming model for the double row layout of facilities
• Combining simulation and optimization for extended double row facility layout problems in factory planning
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Decorous combinatorial lower bounds for row layout problems
• Fast local search for single row facility layout
• Improved exact approaches for row layout problems with departments of equal length
• Integrating design and production planning considerations in multi-bay manufacturing facility layout
• Mathematical optimization approach for facility layout on several rows
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• Multi-period planning and uncertainty issues in cellular manufacturing: a review and future directions
• New exact approaches to row layout problems
• On the One-Dimensional Space Allocation Problem
• On the exact solution of a facility layout problem
• One-Dimensional Space Allocation: An Ordering Algorithm
• Optimal solutions for the double row layout problem
• Provably near-optimal solutions for very large single-row facility layout problems
• Semidefinite relaxations of ordering problems
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• Single row facility layout problem using a permutation-based genetic algorithm
• Single row layout models
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• The corridor allocation problem
• The double row layout problem
• The multi-bay manufacturing facility layout problem
• The single row facility layout problem: state of the art

Cited in

(1)

• Iterated local search with ejection chains for the space-free multi-row facility layout problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Exact approaches for the combined cell layout problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098024)