Heuristics for the dynamic facility layout problem with unequal-area departments

DOI10.1016/j.ejor.2009.02.028zbMath1177.90259OpenAlexW2064676142MaRDI QIDQ1044151

Artak Hakobyan, Alan R. jun. McKendall

Publication date: 10 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://researchrepository.wvu.edu/faculty_publications/3046

zbMATH Keywords

tabu searchmeta-heuristicfacilities planning and designboundary searchdynamic facility layout problemunequal-area departments

Mathematics Subject Classification ID

Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (12)

Recent advances in dynamic facility layout research ⋮ The zone-based dynamic facility layout problem ⋮ 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 cutting plane algorithm for the site layout planning problem with travel barriers ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES ⋮ Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem ⋮ An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm ⋮ Dynamic facility layout problem based on open queuing network theory ⋮ A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem ⋮ Applying ant system for solving unequal area facility layout problems

Cites Work

• The facility layout problem
• An interactive layout heuristic based on hexagonal adjacency graphs
• Flexible machine layout design for dynamic and uncertain production environments
• Extensions of a tabu search adaptation to the quadratic assignment problem
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
• Future paths for integer programming and links to artificial intelligence
• Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts
• Enhanced Model Formulations for Optimal Facility Layout
• The Dynamics of Plant Layout
• Tabu Search Applied to the Quadratic Assignment Problem
• Reasoning about arrays
• An improved tabu search heuristic for solving facility layout design problems
• Preprocessing for static and dynamic facility layout problems
• Static and Dynamic Layout Problems with Varying Areas
• The Reactive Tabu Search
• A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
• An Introduction to Tabu Search
• A coevolutionary algorithm for a facility layout problem

This page was built for publication: Heuristics for the dynamic facility layout problem with unequal-area departments