A Model of Flight Request Collection and Processing in the Flight Scheduling Problem

摘要

A method of analysis of service systems with relative priority, where physical restrictions of request queue generating process are used to derive design formulas is considered. This approach allows one to formalize the interference of partial input flows with description of their dynamic equilibrium and, consequently, to avoid branching of a transition and system state graph by reducing the system model to an ordinary composition of Markov chains for each component of the complete request flow. An example of analysis of priority collection and processing of requests for airspace use in a centralized flight scheduling service established for the united system of Russian air traffic control is given.