In this paper we deal with a common problem found in the operations of security and preventive/corrective maintenance services: that of routing a number of mobile resources to serve foreseen and unforeseen tasks during a shift. We define the (Mobile Re-Allocation Problem) MRAP as the problem of...

In this paper we consider a Jackson type queueing network with unreliable nodes. The network consists of m ∞ nodes, each node is a queueing system of M/G/1 type. The input flow is assumed to be the Poisson process with parameter Λ(t). The routing matrix {r_ij} is given, i, j=0,1,...,m,...