The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.

This paper presents the reliability modelling and analysis of a complex industrial system with two units operating in parallel. To facilitate study, real failure-maintenance data arecollected. Data depicts that unit is repaired upon failure by single repairman. Reliability indices such as mean time between failures, availability, expected number repairs, busy period repairman are estimated usin...

Travelling Repairman Problem (TRP) is one variant of the Travelling Salesman Problem (TSP) with the objective function minimizing the total waiting time for customers served by the repairman. Finding TRP solution is very important because it is often encountered in real world cases. In the TRP, a customer requires a fast service that he was satisfied. TRP is a combinatorial problem that require...

We consider a basic cold standby system attended by a single repairman. The system satisfies the usual conditions (i.i.d. random variables, perfect repair, instantaneous and perfect switch, queueing). The operative unit has a constant failure rate and an arbitrary repair time distribution. We analyse the idle time of the repairman during the survival time of the system. Finally, as an example, ...

In this paper, we discuss a deteriorating system with one repairman. In this system, it is assumed that the component cannot be repaired ”as good as new” after failures and the repairman takes a delayed vacation, the repair time is taken into account. Under these assumptions, we derive a model of partial differential equations by using the geometric process and supplementary variable technique....

This paper discussed a two-unit cold standby system by considering the concepts of degradation, inspection, preventive maintenance (PM), and priority. The unit works as a reduced capacity after its repair and is called degraded unit. There is a single repairman who visits the system immediately. The repairman inspects the failed degraded unit to see the feasibility of repair. If the repair of t...

This paper considers a repairable system with a repairman, who can take multiple vacations. If the system fails and the repairman is on vacation, it will wait for repair until the repairman is available. Assume that the system cannot be repaired ‘‘as good as new’’ after failures. Under these assumptions, using the geometric process and the supplementary variable technique, some important reliab...

A bicriteria approximation algorithm is presented for the unrooted traveling repairman problem, realizing increased profit in return for increased speedup of repairman motion. The algorithm generalizes previous results from the case in which all time windows are the same length to the case in which their lengths can range between l and 2. This analysis can extend to any range of time window len...

This paper analyzed the multi-machine repairable system with one unreliable server and repairman. The machines may break at any time. One oversees servicing machine breakdown. fail time different failure rates in idle busy repairman is responsible for repairing failure; repair rate variable to adapt whether are all functioning normally or not. All distributions exponential. Using quasi-birth-de...

In this paper the two identical unit cold standby systems with single repairman has been discussed.The concept of inspection policy has also been introduced for detecting the kind of failures (major or minor) before the failed unit get repaired by some repair mechanism.The model has been design for the system to calculate the various important measures of reliability i.e MTSF, steady state avai...