Buffer Space Allocation in Automated Assembly Lines

J. MacGregor Smith and Sophia Daskalaki
Additional contact information
J. MacGregor Smith: University of Massachusetts, Amherst, Massachusetts
Sophia Daskalaki: University of Massachusetts, Amherst, Massachusetts

Operations Research, 1988, vol. 36, issue 2, 343-358

Abstract: Automated assembly lines are modeled as finite open queueing networks and a heuristic for buffer space allocation within these lines is presented. The Expansion Method, an analytical technique for modeling finite open queueing networks and Powell's unconstrained optimization procedure are integrated in a design methodology, which evaluates alternative line topologies, system throughputs, and their optimal buffer sizes. The resulting design methodology is demonstrated for series, merging and splitting topologies of automated assembly lines with balanced and unbalanced service rates.

Keywords: 697 queueing networks with finite waiting room; 699 optimization in queueing networks (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.2.343 (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:343-358

Access Statistics for this article

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