Preprocessing for static and dynamic facility layout problems

DOI10.1080/002075497195560MaRDI QIDQ4245262zbMATH OpenOpenAlexFDO

Authors Thomas A. Lacksonen

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

zbMATH Keywords

branch-and-bound strategyfacility layout problems

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Operations research and management science (90B99)

Recommendations

• Static and Dynamic Layout Problems with Varying Areas
• Heuristics for the dynamic facility layout problem with unequal-area departments
• Solution procedures for the dynamic facility layout problem
• The facility layout problem
• Enhanced Model Formulations for Optimal Facility Layout

Cited in

(16)

• The zone-based dynamic facility layout problem
• Constructing an optimal facility layout to maximize adjacency as a function of common boundary length
• Multi-level departments-to-offices assignment with different room types
• A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
• Static and Dynamic Layout Problems with Varying Areas
• Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
• Automatic computation and drawing of facility layouts with logical aisle structures
• Optimal facility layout design
• A simulated annealing algorithm for dynamic layout problem
• A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
• A continuous approach to considering uncertainty in facility design
• A new mixed integer programming formulation for facility layout design using flexible bays
• Heuristics for the dynamic facility layout problem with unequal-area departments
• A biased random-key genetic algorithm for the unequal area facility layout problem
• A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation
• A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays

This page was built for publication: Preprocessing for static and dynamic facility layout problems

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