Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-06-25T04:15:47.598Z Has data issue: false hasContentIssue false
  • English
  • Français

On Klimov's model by two job classes and exponential processing times

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

Xiuli Chao
Xiuli Chao*
Affiliation:
New Jersey Institute of Technology
*
∗ Postal address: Division of Industrial and Management Engineering, New Jersey Institute of Technology, Newark, NJ 07102, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider the Klimov model for an open network of two types of jobs. Jobs of type i arrive at station i, have processing times that are exponentially distributed with parameter µi, and when processed either go on to station j with probability pij, or depart the network with probability pi0. Costs are charged at a rate that depends on the number of jobs of the two types in the system. It is shown that for arbitrary arrival processes the policy that gives priority to those jobs for whom the rate of change of the cost function is greatest minimizes the expected cost rate at every time t. This result is stronger than the Klimov result in two ways: arrival processes are arbitrary, and the minimization is at each time t. But the result holds for only two types.

Keywords

MULTICLASS QUEUESSCHEDULINGPRIORITYKLIMOV'S RULE

MSC classification

Primary: 60K25: Queueing theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 30 , Issue 3 , September 1993 , pp. 716 - 724
Copyright
Copyright © Applied Probability Trust 1993 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research partially supported by a grant from New Jersey Institute of Technology under SBR-421900.

References

Chang, C. S., Chao, X., Pinedo, M. and Weber, R. (1992) On the optimality of LEPT and cµ rules for machines in parallel. J. Appl. Prob. 29, 667–681.Google Scholar
Keilson, J. (1979) Markov Chain Models: Rarity and Exponentiality. Springer-Verlag, New York.Google Scholar
Klimov, G. P. (1974) Time sharing service systems I. Theory Prob. Appl. 19, 532–551.Google Scholar
Lai, T. L. and Ying, Z. (1988) Open bandit problems and optimal scheduling of queueing networks. Adv. Appl. Prob. 20, 447–472.Google Scholar
Nain, P., Tsoucas, P. and Walrand, J. (1989) Interchange arguments in stochastic scheduling. J. Appl. Prob. 27, 815–826.Google Scholar
Varaiya, P. Walrand, J. and Buyukkoc, C. (1985) Extensions of the multiarmed bandit problems: the discounted case. IEEE Trans. Autom. Control. 30, 426–439.Google Scholar