scientific article; zbMATH DE number 4008090

From MaRDI portal
Publication:3758554





[For the entire collection see Zbl 0611.90001.] The paper assumes that two adjacent service network (e.g., ambulance, fire) wish to cooperate at times, however, they maintain local autonomy, hence a global dispatching policy is not a viable solution. Rather they devise alternative local dispatching policies which account for cooperation under certain circumstances. The examination of various local policies initiates transmissions of information between the networks' managers about probabilities of demand and supply of services. This develops into a negotiation process which may (or may not) terminate upon reaching a coordination agreement. The negotiation process resembles a cooperative game. The above approach, which requires a mathematical approximation, is compared with an exact overall approach where an outsider analyst devises a dispatching policy for both networks. Two cases are analyzed with respect to requests for service that occur when all the servers are busy. In the first case, a zero line capacity queue is considered; in the second case an infinite capacity queue is allowed to form.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758554)