DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11068
Title: A time-shared machine repair problem with mixed spares under N-policy
Authors: Shekhar, Chandra
Keywords: Mathematics
N-policy
Markov chain
Machine repair
Mixed spares
Time sharing
Threshold policy
Additional repairman
Queue length
Issue Date: Feb-2016
Publisher: Springer
Abstract: The present investigation deals with a machine repair problem consisting of cold and warm standby machines. The machines are subject to breakdown and are repaired by the permanent repairman operating under N-policy. There is provision of one additional removable repairman who is called upon when the work load of failed machines crosses a certain threshold level and is removed as soon as the work load again ceases to that level. Both repairmen recover the failed machines by following the time sharing concept which means that the repairmen share their repair job simultaneously among all the failed machines that have joined the system for repair. Markovian model has been developed by considering the queue dependent rates and solved analytically using the recursive technique. Various performance indices are derived which are further used to obtain the cost function. By taking illustration, numerical simulation and sensitivity analysis have been provided.
URI: https://link.springer.com/article/10.1007/s40092-015-0136-4
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11068
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.