By Topic

Optimal routing of customers with general independent interarrival times in deterministic parallel queues

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Aicardi, M. ; Dept. of Commun., Comput. & Syst. Sci., Genoa Univ., Italy ; Minciardi, R. ; Pesenti, R.

A queueing system consisting of two parallel heterogeneous servers is considered. Customers ran arrive at discrete-valued instants and, upon their arrivals, they are immediately routed to one of the server buffers. The interarrival times are assumed to be integer, independent, identically distributed random variables, whereas the service times of the servers are assumed to be integer and deterministic. The optimization problem considered is the minimization of the customer mean flow time over an infinite horizon. The existence of a stationary optimal policy with a switchover structure is established

Published in:

Automatic Control, IEEE Transactions on  (Volume:40 ,  Issue: 9 )