Stochastic cyclic flow lines with blocking: Markovian models

Young-Doo Lee () and Tae-Eog Lee ()
Additional contact information
Young-Doo Lee: Korea Advanced Institute of Science and Technology
Tae-Eog Lee: Korea Advanced Institute of Science and Technology

A chapter in Stochastic Modeling of Manufacturing Systems, 2006, pp 149-166 from Springer

Abstract: Abstract We consider a cyclic flow line model that repetitively produces multiple items in a cyclic order. We examine performance of stochastic cyclic flow line models with finite buffers of which processing times have exponential or phase-type distributions. We develop an exact method for computing a two-station model by making use of the matrix geometric structure of the associated Markov chain. We present a computationally tractable approximate performance computing method that decomposes the line model into a number of two-station submodels and parameterizing the submodels by propagating the starvation and blocking probabilities through the adjacent submodels. We discuss performance characteristics including comparison with random order processing and effects of the job variation and the job processing sequence. We also report the accuracy of our proposed method.

Keywords: Cyclic flow line; Stochastic; Blocking; Performance; Decomposition (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-540-29057-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9783540290575

DOI: 10.1007/3-540-29057-5_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().