Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems

Panagiotis Kouvelis and Michael W. Kim
Additional contact information
Panagiotis Kouvelis: Duke University, Durham, North Carolina
Michael W. Kim: University of California, Riverside, California

Operations Research, 1992, vol. 40, issue 3, 533-550

Abstract: In this paper, we address the design of unidirectional loop network layouts for automated manufacturing environments. We show that the problem is NP-complete. Using a workstation interchange argument, we develop dominance relationships for easy identification of local optimal solutions. Our results suggest the need for simple heuristics to solve the problem. We identify cases in which the heuristics perform optimally, and we analyze the worst case behavior of the heuristics. We develop an optimal branch-and-bound procedure that is computationally efficient for medium-sized problems. We also present a decomposition principle helpful for dealing with large workflow matrices. We report computational results on the heuristics and the branch-and-bound procedure. We show that one of the heuristics performs impressively well in terms of solution quality and computational time requirements.

Keywords: facilities/equipment planning: facilities planning for manufacturing systems; manufacturing; layout of automated systems; manufacturing; automated systems: layout of flexible manufacturing systems (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.3.533 (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:40:y:1992:i:3:p:533-550

Access Statistics for this article

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