Efficient models for the facility layout problem
From MaRDI portal
Publication:803026
DOI10.1016/0377-2217(91)90088-DzbMath0726.90024OpenAlexW1979425281MaRDI QIDQ803026
Andrew Kusiak, Sunderesh S. Heragu
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90088-d
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Nonlinear programming (90C30) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (52)
A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices ⋮ The double row layout problem ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation ⋮ A parallel ordering problem in facilities layout ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ A modification of threshold accepting and its application to the quadratic assignment problem ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ A new mixed integer programming formulation for facility layout design using flexible bays ⋮ Expected part delays as a secondary layout criterion in automated manufacturing systems ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Local branching relaxation heuristics for integer linear programs ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ Optimal solutions for the double row layout problem ⋮ Hope: A genetic algorithm for the unequal area facility layout problem. ⋮ The single row facility layout problem: state of the art ⋮ A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem ⋮ An efficient genetic algorithm for single row facility layout ⋮ Local Search Algorithms for the Maximal Planar Layout Problem ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ A new model for robust facility layout problem ⋮ Recent models and techniques for solving the layout problem ⋮ 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 ⋮ Layout optimisation for an installation port of an offshore wind farm ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Integer programming for urban design ⋮ Double-row facility layout with replicate machines and split flows ⋮ Machine layout problem in modern manufacturing facilities ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ On the exact solution of a facility layout problem ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ New exact approaches to row layout problems ⋮ Layout designs in cellular manufacturing ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ Optimal facility layout design ⋮ A new simulated annealing algorithm for the facility layout problem ⋮ A framework for hierarchical interactive generation of cellular layout* ⋮ Facility layout objective functions and robust layouts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quadratic assignment problems
- An exact algorithm for the general quadratic assignment problem
- The facility layout problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- The Quadratic Assignment Problem
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- 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
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- DISCON: A New Method for the Layout Problem
- On the One-Dimensional Space Allocation Problem
- Deux problèmes d'affectation non linéaires
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- Solving quadratic assignment problems with rectangular distances and integer programming
- Optimal Linear Ordering
- Finite-State Processes and Dynamic Programming
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: Efficient models for the facility layout problem
