Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments

DOI10.1016/j.cor.2018.03.013zbMath1458.90430OpenAlexW2794866342MaRDI QIDQ1652644

Jianguang Feng, Ada Che

Publication date: 11 July 2018

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

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

zbMATH Keywords

integer linear programmingfacility layoutadjacency constraints

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Solving an integrated cell formation and group layout problem using a simulated annealing enhanced by linear programming

Cites Work

• Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance
• A computational study and survey of methods for the single-row facility layout problem
• An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
• Optimal facility layout design
• Hope: A genetic algorithm for the unequal area facility layout problem.
• A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
• A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
• Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
• Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations
• Simulated annealing heuristics for the dynamic facility layout problem
• A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
• Assignment Problems and the Location of Economic Activities
• An Exact Approach to the One-Dimensional Facility Layout Problem
• A genetic algorithm based heuristic for adjacent paper-reel layout problem
• A simulated annealing algorithm for dynamic layout problem

This page was built for publication: Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments