The facility layout problem (Q1088577): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An exact branch-and-bound procedure for the quadratic-assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound-based heuristic for solving the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on “Comparison of Computer Algorithms and Visual Based Methods for Plant Layout” by M. Scriabin and R. C. Vergin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On the Complexity of Facilities Layout Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-slot assignment for TDMA-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for quadratic Boolean programs with applications to quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical investigations on quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISCON: A New Method for the Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4750667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hospital Layout as a Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strategy for Solving the Plant Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Comments on the Complexity Rating Factor for Layout Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of the Placement and Quadratic Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the general quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quadratic assignment problem using Benders' decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic assignment problems with rectangular distances and integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Equipment-Layout Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-search algorithms for quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Computer Algorithms for Plant Layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cluster-Analytic Approach to Facility Layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Backboard Wiring Problem: A Placement Algorithm / rank
 
Normal rank

Latest revision as of 17:45, 17 June 2024

scientific article
Language Label Description Also known as
English
The facility layout problem
scientific article

    Statements

    The facility layout problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The facility layout problem is surveyed. Various formulations of the facility layout problem and the algorithms for solving this problem are presented. Twelve heuristic algorithms are compared on the basis of their performance with respect to eight test problems commonly used in the literature. Certain issues related to the facility layout problem and some aspects of the machine layout problem in flexible manufacturing systems are also presented.
    0 references
    facility layout
    0 references
    heuristic algorithms
    0 references
    flexible manufacturing
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references