Mx [M1] QUEUE WITH WORKING VACATION

Simple item page
dc.categoryJournal Article
dc.contributor.authorJulia Rose Mary, K
dc.contributor.authorAfthab Begum, M I
dc.date.accessioned2017-03-31T18:22:32Z
dc.date.available2017-03-31T18:22:32Z
dc.date.issued2010
dc.departmentMathematicsen_US
dc.description.abstractIn this paper a batch arrival Nf/M/I queue with exponentially distributed multiple and single working v jca tio n s is analyzed.The queuing system is modeled as a two-dimensional Markov-chain to obtain the Chapman- Ko.'mogrov equations. The probability generating function (p!jf) of the steady state system size probabilities is derived for the model and the expected system size probabilities are presented in closed form. Further various performance measures including the expected queue length and their graohical representations are presented. Special cases are also discussed.en_US
dc.identifier.urihttps://ir.avinuty.ac.in/handle/avu/2408
dc.langEnglishen_US
dc.publisher.nameActa Cinica Indicaen_US
dc.publisher.typeInternationalen_US
dc.titleMx [M1] QUEUE WITH WORKING VACATIONen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
maths_2010_004.pdf
Size:
5.53 MB
Format:
Adobe Portable Document Format
Download
Collections
Journal Article