Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-22T18:17:05.630Z Has data issue: false hasContentIssue false
  • English
  • Français

Priority queueing model with changeover times and switching threshold

Part of: Special processes Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Yonglu Deng  and
Jiqing Tan
Yonglu Deng*
Affiliation:
Zhongshan University
Jiqing Tan*
Affiliation:
Zhongshan University
*
1Postal address: Department of Statistical Science, Zhongshan University, GuangZhou, China. Email: [email protected]
2Postal address: Department of Mathematics, Zhongshan University, GuangZhou, China.
Get access Rights & Permissions [Opens in a new window]

Abstract

The paper studies a single-server two-queue priority system with changeover times and switching threshold. The server serves queue 1 exhaustively and does not remain at an empty queue if the other one is non-empty. It immediately switches from queue 2 to queue 1 when the length of the latter reaches some level M. Whenever service is changed from one queue to the other a changeover time is required. Arrivals are Poisson, service times and changeover times are independent and exponentially distributed. Using an analytic method we obtain the steady-state joint probability generating function of the lengths of the two queues. By means of this probability generating function some performance measures of the system such as mean length of queue and mean delay can be calculated.

Keywords

Priority queue modelchangeover timeswitching thresholdstationary queue length distribution

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B22: Queues and service
Type
Other stochastic models
Information
Journal of Applied Probability , Volume 38 , Issue A: Probability, Statistics and Seismology , 2001 , pp. 263 - 273
Copyright
Copyright © Applied Probability Trust 2001 

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.)

References

Boxma, O. J., Koole, G. M. and Mitrani, I. (1995). Polling models with threshold switching. In Quantitative Methods in Parallel System , eds Baccelli, F. et al., Springer, New York, 129–139.Google Scholar
Cohen, J. W. (1982). The Single Server Queue , revised edn. North-Holland, Amsterdam.Google Scholar
Deng, Y. L., Ng, J. K. Y. and Li, Z. Y. (2000). Priority queues with threshold switching and setup time. OR Trans. 4, 41–53.Google Scholar
Hofri, M. and Ross, K. (1987). On the optimal control of two queues with server setup times. SIAM J. Comput. 16, 399–420.CrossRefGoogle Scholar
Takagi, H. (1990). Priority queues with setup times. Operat. Res. 38, 667–677.Google Scholar