In this paper we present a formulation of the traveling repairman problem with differentiated waiting times that is derived from the extended disaggregated flow formulation for the asymmetric traveling salesman problem. We focus on the usage of the Lagrangian approach as a mechanism of speeding up the solution of the linear relaxation by a simplex method. We show some computational results.

We investigate Gaver’s parallel system attended by a cold standby unit and a repairman with multiple vacations. By analysing the spectral distribution of the system operator and taking into account the irreducibility of the semigroup generated by the system operator we prove that the dynamic solution converges strongly to the steady state solution. Thus we obtain asymptotic stability of the dyn...

We analyse the reliability (survival function) of a duplex system characterized by hot standby and sustained an auxiliary unit in cold standby. The entire is attended two heterogeneous repairmen. Our methodology based on theory sectionally holomorphic functions combined with notion dual transforms. Finally, we also study total occupational time repairman responsible for repair failed priority d...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 2 July 2019Accepted: 19 2021Published online: 21 October 2021Keywordsminimum latency tour, traveling repairman, approximation algorithms, interval orders, total completion timeAMS Subject Headings68W25, 90C27, 90C59, 90B06, 05C38Publication DataISSN (print): 0097-5397ISSN...

— In the travelling repairman problem (TRP) we are given a finite set of points and the travel times between any two ofthem, and wish to find the route through them which minimizes the sum of the delays for reaching each point. We consider the TRP when ail points are on the straight line, and give a polynomial-time algorithm for it. If we have deadlines (that is, bounds on the maximum delay for...