Static and Dynamic Layout Problems with Varying Areas
From MaRDI portal
Publication:4287626
DOI10.1057/jors.1994.7zbMath0798.90112OpenAlexW1990037521MaRDI QIDQ4287626
Publication date: 1994
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1994.7
quadratic assignmentmixed-integer linear programmingdynamic layoutfacilities layouttwo-step algorithmheuristic cutting plane
Related Items
The zone-based dynamic facility layout problem ⋮ An \(\varepsilon\)-accurate model for optimal unequal-area block layout design ⋮ Constructing an optimal facility layout to maximize adjacency as a function of common boundary length ⋮ 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 graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem ⋮ A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays ⋮ Simulated annealing heuristics for the dynamic facility layout problem ⋮ An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages ⋮ A simulated annealing algorithm for dynamic layout problem ⋮ Layout designs in cellular manufacturing ⋮ Heuristics for the dynamic facility layout problem with unequal-area departments ⋮ Flexible machine layout design for dynamic and uncertain production environments ⋮ Optimal facility layout design ⋮ A continuous approach to considering uncertainty in facility design
