Closedown time dependent Bulk queue with multiple vacations

AUTHOR AND
AFFILIATION

RAM KHILAWAN TIWARI1, NAVAL KISHOR CHAURASIYA1 and DHARMENDRA BADAL2
Department of Mathematics, G.B.S. College, Mauranipur (INDIA)
Department of Mathematical Sciences and Computer Application, Bundelkhand University, Jhansi, U.P. (INDIA)

KEYWORDS:

Bulk queue, multiple vacations, closedown times

Issue Date:

August 2012

Pages:

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.24 – No.2

PDF

Click Here Download PDF

DOI:

jusps-A

ABSTRACT:

In this paper a Closedown time concent is introduced in a Bulk queuing model closedown time dependent a MX/G(a,b)/queuing system with multiple vacation is considered. After completing a service, if the queue length is  , where  <a, then the server performs closedown work. After that the server leaves for multiple vacation of random length, irrespective of queue length. After a vacation, when it returns. If the queue length is less than ‘a’, it leaves for another vacation and so on, until he finds ‘a’ customers in the queue. After a vacation, if the server finds at least ‘a’ customers waiting for service, say , then he serves a batch of size min (,b) customers, where b >a. Various Characteristics of the queueing system and a cost model with the numerical result for a particular case of the model are presented in this paper.

Copy the following to cite this Article:

RAM KHILAWAN TIWARI1, NAVAL KISHOR CHAURASIYA1 and DHARMENDRA BADAL2, “Closedown time dependent Bulk queue with multiple vacations”, Journal of Ultra Scientist of Physical Sciences, Volume 24, Issue 2, Page Number , 2016


Copy the following to cite this URL:

RAM KHILAWAN TIWARI1, NAVAL KISHOR CHAURASIYA1 and DHARMENDRA BADAL2, “Closedown time dependent Bulk queue with multiple vacations”, Journal of Ultra Scientist of Physical Sciences, Volume 24, Issue 2, Page Number , 2016

Available from: http://www.ultrascientist.org/paper/428/


In this paper a Closedown time concent is introduced in a Bulk queuing model closedown time dependent a MX/G(a,b)/queuing system with multiple vacation is considered. After completing a service, if the queue length is  , where  <a, then the server performs closedown work. After that the server leaves for multiple vacation of random length, irrespective of queue length. After a vacation, when it returns. If the queue length is less than ‘a’, it leaves for another vacation and so on, until he finds ‘a’ customers in the queue. After a vacation, if the server finds at least ‘a’ customers waiting for service, say , then he serves a batch of size min (,b) customers, where b >a. Various Characteristics of the queueing system and a cost model with the numerical result for a particular case of the model are presented in this paper.