Structured buffer-allocation problems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

24 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)9-41
Journal / PublicationDiscrete Event Dynamic Systems: Theory and Applications
Volume6
Issue number1
Publication statusPublished - 1996
Externally publishedYes

Abstract

We study the effect of changing buffer sizes in serial lines with general blocking, a mechanism that incorporates limited intermediate finished goods inventory at each stage, as well as limited intermediate raw material inventory. This model includes ordinary manufacturing, communication, and kanban blocking as special cases. We present conditions under which increasing buffer sizes or re-allocating buffer capacity increases throughput, and in some cases characterize optimal allocations. Our comparisons hold pathwise; they depend on structural properties of a line but not its service time distributions. The key to our analysis is formulating the model as a generalized semi-Markov process (GSMP). We show that a serial line with general blocking possesses various structural properties from which pathwise comparisons follow directly, making a detailed case-by-case analysis unnecessary. These results help illustrate the power of GSMPs as a modeling framework. © 1996 Kluwer Academic Publishers.

Research Area(s)

  • Antimatroids, Finite-buffer queues, Generalized semi-Markov processes

Citation Format(s)

Structured buffer-allocation problems. / Glasserman, Paul; Yao, David D.

In: Discrete Event Dynamic Systems: Theory and Applications, Vol. 6, No. 1, 1996, p. 9-41.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review