Heuristics for the dynamic facility layout problem with unequal-area departments
DOI10.1016/J.EJOR.2009.02.028zbMATH Open1177.90259OpenAlexW2064676142MaRDI QIDQ1044151FDOQ1044151
Authors: Artak S. 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
Recommendations
tabu searchfacilities planning and designmeta-heuristicboundary searchdynamic facility layout problemunequal-area departments
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Continuous location (90B85)
Cites Work
- Future paths for integer programming and links to artificial intelligence
- The facility layout problem
- Flexible machine layout design for dynamic and uncertain production environments
- Enhanced Model Formulations for Optimal Facility Layout
- Tabu Search Applied to the Quadratic Assignment Problem
- Preprocessing for static and dynamic facility layout problems
- A coevolutionary algorithm for a facility layout problem
- An Introduction to Tabu Search
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- The Reactive Tabu Search
- Static and Dynamic Layout Problems with Varying Areas
- The Dynamics of Plant Layout
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Extensions of a tabu search adaptation to the quadratic assignment problem
- An interactive layout heuristic based on hexagonal adjacency graphs
- Strategic Interpolative Design of Dynamic Manufacturing Systems Layouts
- Reasoning about arrays
- An improved tabu search heuristic for solving facility layout design problems
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
Cited In (17)
- An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm
- A cutting plane algorithm for the site layout planning problem with travel barriers
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- An efficient algorithm for unequal area facilities layout planning with input and output points
- The zone-based dynamic facility layout problem
- New heuristic for the dynamic layout problem
- DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- Applying ant system for solving unequal area facility layout problems
- A generalized constructive algorithm using insertion-based heuristics
- The Dynamics of Plant Layout
- Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem
- Recent advances in dynamic facility layout research
- An extended distance-based facility layout problem
- Dynamic facility layout problem based on open queuing network theory
This page was built for publication: Heuristics for the dynamic facility layout problem with unequal-area departments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044151)