DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11075
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhar, Chandra-
dc.date.accessioned2023-08-01T09:15:40Z-
dc.date.available2023-08-01T09:15:40Z-
dc.date.issued2013-07-
dc.identifier.urihttps://link.springer.com/article/10.1007/s12597-013-0152-3-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11075-
dc.description.abstractThis investigation deals with a machine repair problem having an unreliable server where the accumulation of failed machines is controlled under Fpolicy. The failed machines will continue to accumulate in the system for the repair till its full capacity K; then the server provides the repair but will not allow other failed machines for repair until the queue length is reduced to the threshold value F at which the server starts accepting failed machines again. The server takes some time to initiate the service of failed machines. The server is also prone to breakdown and its repair time is exponentially distributed. The successive-over-relaxation method has been used to obtain the steady-state probabilities. Various performance characteristics have also been derived to study the system effectively. Numerical results have been presented to facilitate the sensitivity analysis by taking illustrations.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectMachine Repair Problemen_US
dc.subjectF-policyen_US
dc.subjectUnreliable serversen_US
dc.subjectStart-up timeen_US
dc.subjectMarkov chainen_US
dc.subjectQueue lengthen_US
dc.titleMachine repair problem with an unreliable server and controlled arrival of failed machinesen_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.