An iterative facility layout algorithm
From MaRDI portal
Publication:4497152
DOI10.1080/002075499190022zbMATH Open0948.90535OpenAlexW2107273240MaRDI QIDQ4497152FDOQ4497152
Publication date: 21 August 2000
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075499190022
Cited In (11)
- A convex optimisation framework for the unequal-areas facility layout problem
- Automatic computation and drawing of facility layouts with logical aisle structures
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A new mixed integer programming formulation for facility layout design using flexible bays
- An improved two-stage optimization-based framework for unequal-areas facility layout
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- A slicing tree representation and QCP-model-based heuristic algorithm for the unequal-area block facility layout problem
- Extensions to STaTS for practical applications of the facility layout problem
- Slicing tree's geometric potential: an indicator for layout problems based on slicing tree structure
Recommendations
- A genetic algorithm approach for multiple criteria facility layout design 👍 👎
- Hope: A genetic algorithm for the unequal area facility layout problem. 👍 👎
- Skeleton-based facility layout design using genetic algorithms 👍 👎
- A genetic algorithm for facility layout 👍 👎
- A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem 👍 👎
This page was built for publication: An iterative facility layout algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4497152)
