We consider a real-world problem of military intelligence unit equipped with multiple identical unmanned aerial vehicles (UAV) responsible for several regions (with requests of real-time jobs arriving from independent sources). We suppose that there are no ample maintenance facilities, allowing simultaneous treatment of all vehicles if necessary. Under certain assumptions, these real-time systems can be treated using a queueing theory methodology and/or as Markov chains. We show how to compute steady-state probabilities of these systems, their performance effectiveness, and various performance parameters (for exponentially distributed service and maintenance times of UAVs, as well as tasks duration and their arrival pattern).