G G r Machine Repair Problem with Spares and Additional Repairman (TECHNICAL NOTE)

Authors

  • Madhu Jain Department Of Mathematics, IIT Roorkee,Roorkee,India
Abstract:

The machine repair problem with spares and additional repairman is analyzed. The interfailure and repair times of the units are general identical and independently distributed. The failure and repair rates are assumed to be state dependent. Using diffusion approximation technique, we obtain the queue size distribution under steady state. The average number of failed units, average number of operating units in the system and the probability of the system being short are obtained by using the queue size distribution.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Reliability Analysis of K-Out-Of N: G Machining Systems with Mixed Spares and Multiple Modes of Failure (TECHNICAL NOTE)

This paper deals with the transient analysis of K-out-of-N: G system consisting of Noperatingmachines. To improve system reliability, Y cold standby and S warm standbys spares areprovided to replace the failed machines. The machines are assumed to fail in multiple modes. At leastK-out-of-N machines for smooth functioning of the system. Reliability and mean time to failure areestablished in term...

full text

Optimization of M G 1 Queue with Vacation (TECHNICAL NOTE)

This paper reports on the minimization of the average waiting time of the customers in the M/G/1 queue with vacation. Explicit formula for the unknown service parameter of a particular customer has been obtained by considering the exhaustive service discipline in the case of multi-user with unlimited service system. Moreover, results in case of partially gated and gated service disciplines unde...

full text

A time-shared machine repair problem with mixed spares under N-policy

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 wor...

full text

The heavy-tailed heavy-traffic machine-repairman problem: A GI/G/2 Queue

Recent research in queuing focuses more on the impacts of heavy-tailed service times, neglecting the fact that stochastic inter-arrival times are often heavy-tailed as well. We investigate the impacts of heavy-tailed gamma inter-arrival time distributions on the waiting-time distribution of a GI/G/2 queue, and simulate the tail properties of waiting-time distribution using real data.

full text

Maximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

full text

The Machine Learning and Traveling Repairman Problem

The goal of the Machine Learning and Traveling Repairman Problem (ML&TRP) is to determine a route for a “repair crew,” which repairs nodes on a graph. The repair crew aims to minimize the cost of failures at the nodes, but the failure probabilities are not known and must be estimated. If there is uncertainty in the failure probability estimates, we take this uncertainty into account in an unusu...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 15  issue 1

pages  57- 62

publication date 2002-04-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023