DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11077
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhar, Chandra-
dc.date.accessioned2023-08-01T09:48:20Z-
dc.date.available2023-08-01T09:48:20Z-
dc.date.issued2014-07-
dc.identifier.urihttps://www.inderscienceonline.com/doi/abs/10.1504/IJOR.2014.063154-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11077-
dc.description.abstractThis investigation is concerned with multi-component machining system having two types of warm standby units and two unreliable heterogeneous repairmen. The life time and repair time of the failed units are exponentially distributed. The first repairman is working according to N (N ≥ 1) policy whereas the second repairman has the privilege of going for a vacation of random length. Both repairmen may also fail while rendering the repair to the failed units either individually or simultaneously. Runge-Kutta method is used to obtain the transient-state probabilities of the system states for which Chapman-Kolmogrov differential equations governing the model are constructed. We have established some indices for the system performance in terms of transient probabilities. The sensitivity analysis is carried out to examine the system efficiency and profitability as per requirements. The numerical results are provided in order to explore the sensitivity of the system descriptors on the performance measures more precisely.en_US
dc.language.isoenen_US
dc.publisherInder Scienceen_US
dc.subjectMathematicsen_US
dc.subjectN-policyen_US
dc.subjectMachine repairen_US
dc.subjectTransient probabilitiesen_US
dc.subjectHeterogeneous repairmenen_US
dc.subjectVacationen_US
dc.titleVacation queuing model for a machining system with two unreliable repairmenen_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.