Exact approaches for the combined cell layout problem

DOI10.1016/J.EJOR.2022.04.031OpenAlexW4225140783MaRDI QIDQ2098024FDOQ2098024

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

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)

Cites Work

• A new lower bound for the single row facility layout problem
• The single row facility layout problem: state of the art
• 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
• On the exact solution of a facility layout problem
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes
• Single row layout models
• Fast local search for single row facility layout
• An Exact Approach to the One-Dimensional Facility Layout Problem
• Provably near-optimal solutions for very large single-row facility layout problems
• 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
• On the One-Dimensional Space Allocation Problem
• Single row facility layout problem using a permutation-based genetic algorithm
• One-Dimensional Space Allocation: An Ordering Algorithm
• A polyhedral study of triplet formulation for single row facility layout problem
• A new mixed integer programming formulation for facility layout design using flexible bays
• Optimal solutions for the double row layout problem
• The double row layout problem
• A parallel ordering problem in facilities layout
• The corridor allocation problem
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• Multi-period planning and uncertainty issues in cellular manufacturing: a review and future directions
• The multi-bay manufacturing facility layout problem
• Integrating design and production planning considerations in multi-bay manufacturing facility layout
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• 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
• A decomposition-based algorithm for the double row layout problem
• Mathematical optimization approach for facility layout on several rows
• Decorous combinatorial lower bounds for row layout problems
• New exact approaches to row layout problems
• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
• Combining simulation and optimization for extended double row facility layout problems in factory planning
• An Exact Approach for the Combined Cell Layout Problem

Cited In (1)

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

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)