DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11312
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Rajesh-
dc.date.accessioned2023-08-11T07:02:07Z-
dc.date.available2023-08-11T07:02:07Z-
dc.date.issued2021-03-
dc.identifier.urihttps://www.inderscienceonline.com/doi/abs/10.1504/IJMOR.2021.113586-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11312-
dc.description.abstractThe transient behaviour of single server bulk queues with finite-buffer capacity is discussed numerically under the assumption that the server may take multiple working vacations after completing a busy period. It is considered that the inter-arrival and the service times are exponentially distributed and independent of each other. The buffer space is limited, therefore partial and full batch rejection policies are studied for the bulk arrival queueing model. However, for the batch service, the general bulk service rule is considered. Using probabilistic arguments and relating the state of the systems at two consecutive time epochs, differential equations are obtained to model such phenomena. Further, these equations are solved numerically by Runge-Kutta method and the time dependent numerical solutions are compared with the exact stationary solutions. The blocking probability and the mean waiting time of the first, last and an arbitrary customer are also reviewed mathematically and computed numerically.en_US
dc.language.isoenen_US
dc.publisherInder Scienceen_US
dc.subjectMathematicsen_US
dc.subjectQueuing theoryen_US
dc.subjectBatch arrivalen_US
dc.subjectBulk serviceen_US
dc.subjectTransient solutionen_US
dc.subjectRunge-Kuttaen_US
dc.titleNumerical study on transient behaviour of finite bulk arrival or service queues with multiple working vacationsen_US
dc.typeArticleen_US
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.