The facility layout problem
From MaRDI portal
Publication:1088577
DOI10.1016/0377-2217(87)90238-4zbMath0612.90035OpenAlexW2048135233MaRDI QIDQ1088577
Andrew Kusiak, Sunderesh S. Heragu
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90238-4
Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items
An efficient algorithm for unequal area facilities layout planning with input and output points, Comment on ``The facility layout problem, The double row layout problem, The facility layout problem, Ant colony optimization for solving an industrial layout problem, An \(\varepsilon\)-accurate model for optimal unequal-area block layout design, An ant algorithm for the single row layout problem in flexible manufacturing systems, Genetic search and the dynamic facility layout problem, A biased random-key genetic algorithm for the unequal area facility layout problem, Solving multi objective facility layout problem by modified simulated annealing, CLASS: Computerized LAyout Solutions using Simulated annealing, A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation, New trends in machine scheduling, A cutting plane algorithm for the site layout planning problem with travel barriers, A modification of threshold accepting and its application to the quadratic assignment problem, A new mixed integer programming formulation for facility layout design using flexible bays, Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations, Location and layout planning. A survey, Expected part delays as a secondary layout criterion in automated manufacturing systems, Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models, Special cases of the quadratic assignment problem, A heuristic procedure for the single-row facility layout problem, Two-level modified simulated annealing based approach for solving facility layout problem, A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic, Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities, FACOPT: A user friendly FACility layout OPTimization system., Local Search Algorithms for the Maximal Planar Layout Problem, Single and multiple period layout models for automated manufacturing systems, Integrating big data analytic and hybrid firefly-chaotic simulated annealing approach for facility layout problem, Recent models and techniques for solving the layout problem, Flow network design for manufacturing systems layout, A nonlinear optimization approach for solving facility layout problems, Experimental analysis of simulated annealing based algorithms for the layout problem, Simulated annealing for machine layout problems in the presence of zoning constraints, Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem, Solutions for the constrained dynamic facility layout problem, Layout optimisation for an installation port of an offshore wind farm, An interactive layout heuristic based on hexagonal adjacency graphs, Spine layout design, A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem, Reconfigurable layout problem, A genetic algorithm for facility layout, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, Integrating design and production planning considerations in multi-bay manufacturing facility layout, Loop based facility planning and material handling, Layout optimization considering production uncertainty and routing flexibility, An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance, A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem, Mitigation of risk in facility layout design for single and multi-period problems, An integrated approach to determine the block layout, AGV flow path and the location of pick-up/delivery points in single-loop systems, A hybrid heuristic for the facilities layout problem, Two graph-theoretic procedures for an improved solution to the facilities layout problem, Solving the facility and layout and location problem by ant-colony optimization-meta heuristic, A local genetic approach to multi-objective, facility layout problems with fixed aisles, A simulated annealing algorithm for dynamic layout problem, An efficient two-staged approach for generating block layouts, An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems, A convex form of the quadratic assignment problem, Layout designs in cellular manufacturing, Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes, A neural network approach to facility layout problems, GRASP with Path-Relinking for Facility Layout, Incorporating heterogeneous distance metrics within block layout design, Heuristic approach for solving the multi-objective facility layout problem, Integrated design of the block layout and aisle structure by simulated annealing, Heuristics for the dynamic facility layout problem with unequal-area departments, A practical method for design of hybrid-type production facilities, An integrated methodology for automating the determination of layout and materials handling system, An improved tabu search heuristic for solving facility layout design problems, Facility layout objective functions and robust layouts, A continuous approach to considering uncertainty in facility design, Efficient models for the facility layout problem, A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems, Cell formations in the uni-directional loop material handling environment, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for the general quadratic assignment problem
- The facility layout problem
- On the quadratic assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- Parallel concepts in graph theory
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Time-slot assignment for TDMA-systems
- The Quadratic Assignment Problem
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A Cluster-Analytic Approach to Facility Layout
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- DISCON: A New Method for the Layout Problem
- The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies
- Note—Comments on the Complexity Rating Factor for Layout Problems
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- P-Complete Approximation Problems
- A Strategy for Solving the Plant Layout Problem
- Hospital Layout as a Quadratic Assignment Problem
- Note—A Note on “Comparison of Computer Algorithms and Visual Based Methods for Plant Layout” by M. Scriabin and R. C. Vergin
- Solving quadratic assignment problems with rectangular distances and integer programming
- Numerical investigations on quadratic assignment problems
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Note—On the Complexity of Facilities Layout Problems
- An Efficient Equipment-Layout Algorithm
- An Algorithm for the Traveling Salesman Problem
- An Algorithm for the Quadratic Assignment Problem
- Tree-search algorithms for quadratic assignment problems
- A Review of the Placement and Quadratic Assignment Problems
- The Efficiency of Computer Algorithms for Plant Layout
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem