DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11057
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhar, Chandra-
dc.date.accessioned2023-07-28T09:07:54Z-
dc.date.available2023-07-28T09:07:54Z-
dc.date.issued2023-07-
dc.identifier.urihttps://www.tandfonline.com/doi/abs/10.1080/16843703.2023.2232639?src=&journalCode=ttqm20-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11057-
dc.description.abstractThis study aims to discuss queueing modeling of machine repair problems under threshold recovery policy (Q), server unreliability and k-type phase repairs. When one or more machines in the system fails/fail, the service facility (or all R-servers) is activated and repairs the failed machine according to the first come, first served (FCFS) discipline. The service facility may experience a partial or complete breakdown while providing service and needs to be repaired in required phases under the threshold recovery policy (Q). The matrix geometric approach is applied to solve the system governing equations, and a sensitivity analysis is presented to understand the effect of various parameters on system performance metrics. The greedy selection method and the golden section method are used to compute optimal rates of (R∗,μ∗) of service facility in order to minimize the cost function of the system.en_US
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.subjectMathematicsen_US
dc.subjectMachine Repair Systemen_US
dc.subjectThreshold recovery policy (Q)en_US
dc.subjectMixed standbysen_US
dc.subjectUnreliable serversen_US
dc.subjectPhase repairsen_US
dc.titleMachine repair system with threshold recovery policy, unreliable servers and phase repairsen_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.