The corridor allocation problem

DOI10.1016/j.cor.2012.04.016zbMath1349.90552OpenAlexW1966748173MaRDI QIDQ339697

André R. S. Amaral

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.016

zbMATH Keywords

integer programmingfacility layoutdouble row layout

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items

A parallel ordering problem in facilities layout, Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm, Improved exact approaches for row layout problems with departments of equal length, Fast simulated annealing for single-row equidistant facility layout, Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem, Decorous combinatorial lower bounds for row layout problems, Corridor Allocation as a Constrained Optimization Problem Using a Permutation-Based Multi-objective Genetic Algorithm, An improved mixed-integer programming model for the double row layout of facilities, 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, A decomposition-based algorithm for the double row layout problem, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, Multi-level departments-to-offices assignment with different room types, Simulated annealing and tabu search approaches for the Corridor Allocation Problem, Double-row facility layout with replicate machines and split flows, New exact approaches to row layout problems, Exact approaches for the combined cell layout problem

Cites Work

• A polyhedral approach to the single row facility layout problem
• Single row facility layout problem using a permutation-based genetic algorithm
• Facets of the clique partitioning polytope
• A new lower bound for the single row facility layout problem
• Multiprocessor scheduling under precedence constraints: polyhedral results
• On the exact solution of a facility layout problem
• Global Approaches for Facility Layout and VLSI Floorplanning
• 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
• Facets of the linear ordering polytope
• One-Dimensional Space Allocation: An Ordering Algorithm