DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11067
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhar, Chandra-
dc.date.accessioned2023-08-01T06:42:44Z-
dc.date.available2023-08-01T06:42:44Z-
dc.date.issued2015-12-
dc.identifier.urihttps://link.springer.com/article/10.1007/s40010-015-0233-1-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11067-
dc.description.abstractThis paper deals with the queueing characterization of a machine repair problem with single working vacation and controlled arrival of failed machines under F-policy. The server allows the failed machines to enter the system till full capacity K and thereafter the arrival of the failed machines is prohibited which continues till the queue length is reduced to the threshold value F. The server takes some time to start the repair of the failed machines. The life time of the machines, startup time and repair time of the server are exponentially distributed. When the system is empty, the server goes for a single vacation but it keeps on serving the failed units even during vacation at a different pace, and is said to be on working vacation. The matrix method has been used to obtain the steady state probabilities of the system states. Various performance characteristics have been derived. The numerical results have been obtained and shown in tables and graphs.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectMachine repairen_US
dc.subjectControlled ratesen_US
dc.subjectStart-up timeen_US
dc.subjectWorking vacationen_US
dc.titleQueueing Analysis of Machine Repair Problem with Controlled Rates and Working Vacation Under F-Policyen_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.