Computerized facility layout with graph theory
| Autor: | Ardavan Nozari, E. Emory Enscore |
|---|---|
| Rok vydání: | 1981 |
| Předmět: |
Theoretical computer science
General Computer Science Computer science General Engineering Topology (electrical circuits) Graph theory Planarity testing Planar graph symbols.namesake Graph bandwidth Dual graph symbols Layout Versus Schematic Representation (mathematics) MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | Computers & Industrial Engineering. 5:183-193 |
| ISSN: | 0360-8352 |
| DOI: | 10.1016/0360-8352(81)90004-8 |
| Popis: | This paper describes a plant layout procedure based on graph theory. Given a relationship chart for the departments of the layout, the branch and bound technique is used to obtain an optimal relationship diagram. The planar representation of this relationship diagram is next obtained via a single planarity testing procedure. The planar graph's dual graph is found which gives the topology of the proposed final layout. Due to the time and complexities involved, the entire layout procedure described to this point is computerized. Using the topology of the dual graph, one can place the departments into the final layout. An example is presented to demonstrate the plant layout procedure in its entirely. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|