On the average optimality of circular assignment policy

DOI10.1007/BF01164004MaRDI QIDQ1201826zbMATH OpenOpenAlexFDO

Authors Koichi Nakade, Masamitsu Ohnishi, Toshihide Ibaraki, Katsuhisa Ohno

Publication date 17 January 1993

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01164004

zbMATH Keywords

parallel queueing systemaverage expected costcircular assignment policy

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• On the Assignment of Customers to Parallel Queues
• On the Optimality of the Generalized Shortest Queue Policy
• Optimality of the round-robin routing policy
• An assignment problem for a parallel queueing system with two heterogeneous servers
• On the optimal allocation of customers that must depart in sequence

Cites work

• A simple dynamic routing problem
• On the optimal assignment of customers to parallel servers
• Optimality of the shortest line discipline

Cited in

(2)

• On the Assignment of Customers to Parallel Queues
• Analyzing weighted round robin policies with a stochastic comparison approach

This page was built for publication: On the average optimality of circular assignment policy

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