Machine Layout Problem in Flexible Manufacturing Systems

Sunderesh S. Heragu and Andrew Kusiak
Additional contact information
Sunderesh S. Heragu: University of Manitoba, Winnipeg, Manitoba, Canada
Andrew Kusiak: University of Manitoba, Winnipeg, Manitoba, Canada

Operations Research, 1988, vol. 36, issue 2, 258-268

Abstract: This paper analyzes the machine layout problem in flexible manufacturing systems (FMS's). We show that the quadratic assignment formulation cannot be used to model the machine layout problem. Four basic types of machine layouts that are frequently encountered in FMS's are presented. A measure to determine the relationship between machines is introduced. Since automated guided vehicles are commonly used to transport material between machines, their motion characteristic is discussed. Two new construction algorithms are presented to solve the machine layout problem in FMS's. They generate solutions with acceptable quality in low computational time. The triangle assignment algorithm (TAA) is compared to existing methods for 8 test problems and is found to give solutions of better quality than any other construction method published. When compared to existing methods, the computation time performance is attractive.

Keywords: 014 comparison of heuristic algorithms; 152 flexible manufacturing systems; 184 machine layout problem (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (41)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.2.258 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:36:y:1988:i:2:p:258-268

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().