Skip to main content
SpringerLink
Log in

On the average optimality of circular assignment policy

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider a parallel queueing system with identical exponential servers. Customers arrive according to a renewal process and upon arrival are immediately assigned to those queues. The problem is to find an optimal assignment policy minimizing the longrun average expected cost, without information about the current queue lengths, but with the initial queue-length distributions and information about the past arrival process and assignment of customers. In this paper, it is shown that the so-called circular assignment policy is optimal under mild conditions on the initial queue-length distributions and the holding cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Ephremides, P. Varaiya and J. Walrand, A simple routing problem, IEEE Trans. Auto. Control AC-25(1980)690–693.

    Google Scholar 

  2. Y. Hirota, M. Ohnishi and T. Ibaraki, Optimal assigment of bulk arrival customers to identical exponential servers, in:Proc. Seminar on Queueing Theory and Its Applications, Kyoto, Japan (1987), pp. 185–203.

  3. K. Nakade, M. Ohnishi, T. Ibaraki and K. Ohno, Optimal assignment of bulk arrival customers in homogeneous parallel queueing systems without information of queues, Technical Report No. 90010, Department of Applied Mathematics and Physics, Kyoto University, Kyoto, Japan (1990).

    Google Scholar 

  4. S.N. Ross,Stochastic Processes (Wiley, New York, 1983).

    Google Scholar 

  5. M. Schäl, Estimation and control in a GI/M/1 system, in: Preprint No. 428, SFB72, Universität Bonn, Bonn (1981).

    Google Scholar 

  6. L. Takács,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).

    Google Scholar 

  7. R. Weber, On the optimal assignment of customers to parallel servers, J. Appl. Prob. 15(1978) 406–413.

    Google Scholar 

  8. W. Winston, Optimality of the shortest line discipline, J. Appl. Prob. 14(1977)181–189.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Systems Engineering, Nagoya Institute of Technology, 466, Nagoya, Japan

    Koichi Nakade & Katsuhisa Ohno

  2. Department of Applied Mathematics and Physics, Faculty of Engineering Kyoto, University Kyoto, 606-01, Japan

    Masamitsu Ohnishf & Toshihide Ibaraki

Authors
  1. Koichi Nakade
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masamitsu Ohnishf
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Katsuhisa Ohno
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nakade, K., Ohnishf, M., Ibaraki, T. et al. On the average optimality of circular assignment policy. Queueing Syst 11, 241–254 (1992). https://doi.org/10.1007/BF01164004

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01164004

Keywords

Search

Navigation