Preprocessing for static and dynamic facility layout problems
From MaRDI portal
Publication:4245262
DOI10.1080/002075497195560zbMath0953.90557OpenAlexW1970544571MaRDI QIDQ4245262
Publication date: 8 June 1999
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075497195560
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Operations research and management science (90B99)
Related Items
The zone-based dynamic facility layout problem, Constructing an optimal facility layout to maximize adjacency as a function of common boundary length, A biased random-key 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 new mixed integer programming formulation for facility layout design using flexible bays, A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics, A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays, Multi-level departments-to-offices assignment with different room types, Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem, A simulated annealing algorithm for dynamic layout problem, Heuristics for the dynamic facility layout problem with unequal-area departments, Optimal facility layout design, A continuous approach to considering uncertainty in facility design
