We introduce a robot-safety device system attended by two di erent repairmen. The twin system is characterized by the natural feature of cold standby and by an admissible “risky” state. In order to analyse the random behaviour of the entire system (robot, safety device, repair facility), we employ a stochastic process endowed with probability measures satisfying general steady-state di erential...

In this paper we describe G/G/R+s multi- repairmen machining system with balking. The system consists of M operating machines, S spare machines, R permanent and s additional repairmen. Assuming the discrete flow of machines by continuous one, the diffusion approximation technique for the machine repair system has developed. The system will be in normal working mode if there is M operating machi...

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

Given an undirected graph G= (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starting at s and together covering all the vertices (customers) such that the sum of the latencies experienced by the customers is minimum. Latency of a customer p is defined to be the distance traveled (time elapsed) before v...

The Traveling Salesman Problem (TSP) is a classical problem in discrete optimization. Its paradigmatic character makes it one of the most studied in computer science and operations research and one for which an impressive amount of algorithms (in particular heuristics and approximation algorithms) have been proposed. While in the general case the problem is known not to allow any constant ratio...

In this paper, we analyze a machine repairable system with warm spares and two repairmen. The first repairman never takes vacations. The second repairman leaves for a vacation of random length when the number of the failed units is less than N. At the end of a vacation period, this repairman returns back if there are N or more failed units accumulated in the system. Otherwise this repairman goe...