Dynamic arrival routing — a generalized problem and an optimal routing algorithm

Abstract

A generalized problem in dynamically routing the arrivals in a parallel queueing network is proposed and anoptimal routing algorithm developed. Customers arrive in an arbitrary stream into a queueing network composed of n parallel G: M l queues. The individual mean service times of the n servers are distinct; the individual queue lengths arc measurable. It is desired by appropriately regulating routing of arrivals, to minimize the running cost of the system, viz., the expected total time for the completion of service on all customers arriving within a specific time interval . Optimality of a proposed algorithm is proved and is further substantiated by simulation results.