Analysis of a MAP/PH/1 queue with discretionary priority

In this paper, we study a MAP/PH/1 queue with two classes of customers and discretionary priority. There are two stages of service for the low-priority customer. The server adopts the preemptive priority discipline at the first stage and adopts the nonpreemptive priority discipline at the second stage. Such a queueing system can be modelled into a quasi-birth-and-death (QBD) process. But there is no general solution for this QBD process since the generator matrix has a block structure with an infinite number of blocks and each block has infinite dimensions. We present an approach to derive the bound for the high-priority queue length. It guarantees that the probabilities of ignored states are within a given error bound, so that the system can be modelled into a QBD process where the block elements of the generator matrix have finite dimensions. Sojourn time distributions of both high and low priority customers are obtained.

[1]  Leon F. McGinnis,et al.  Queueing models for a single machine subject to multiple types of interruptions , 2011 .

[2]  Leon F. McGinnis,et al.  Queueing models for single machine manufacturing systems , 2008 .

[3]  Kan Wu,et al.  The Determination and Indetermination of Service Times in Manufacturing Systems , 2008, IEEE Transactions on Semiconductor Manufacturing.

[4]  Attahiru Sule Alfa,et al.  Advances in matrix-analytic methods for stochastic models , 1998 .

[5]  Leon F. McGinnis,et al.  Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization , 2012, Eur. J. Oper. Res..

[6]  M. Brahimi,et al.  Queueing Models for Out-Patient Appointment Systems — a Case Study , 1991 .

[7]  Leon F. McGinnis,et al.  Queueing models for single machine manufacturing systems with interruptions , 2008, 2008 Winter Simulation Conference.

[8]  B. Krishna Kumar,et al.  An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume , 2002, Ann. Oper. Res..

[9]  M. Neuts.  A Versatile Markovian Point Process , 1979 .

[10]  Quan-Lin Li,et al.  Constructive Computation in Stochastic Models with Applications , 2010 .

[11]  Srinivas R. Chakravarthy,et al.  Performance Analysis and Optimal Threshold Policies for Queueing Systems with Several Heterogeneous Servers and Markov Modulated Arrivals , 2016 .

[12]  F. Al-Shamali,et al.  Author Biographies. , 2015, Journal of social work in disability & rehabilitation.

[13]  Kan Wu,et al.  An examination of variability and its basic properties for a factory , 2005, IEEE Transactions on Semiconductor Manufacturing.

[14]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[15]  Yijun Xu,et al.  Approximating the performance of a station subject to changeover setups , 2014, Proceedings of the Winter Simulation Conference 2014.

[16]  Leon F. McGinnis,et al.  Approximating the Performance of a Batch Service Queue Using the ${\rm M/M}^{\rm k}/1$ Model , 2011, IEEE Transactions on Automation Science and Engineering.

[17]  Kan Wu,et al.  Dependence among single stations in series and its applications in productivity improvement , 2015, Eur. J. Oper. Res..

[18]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[19]  Leon F. McGinnis,et al.  Approximating the Performance of a Batch Service Queue Using the M/M , 2011, TASE 2011.

[20]  P. Naor,et al.  On discretionary priority queueing , 1964 .

[21]  Paul R. Kleindorfer,et al.  Service Constrained s, S Inventory Systems with Priority Demand Classes and Lost Sales , 1988 .

[22]  Attahiru Sule Alfa,et al.  Performance analysis of a telephone system with both patient and impatient customers , 1995, Telecommun. Syst..

[23]  Chong Kwan Un,et al.  Analysis of the M/G/1 queue under a combined preemptive/nonpreemptive priority discipline , 1993, IEEE Trans. Commun..

[24]  Leon F. McGinnis,et al.  Interpolation approximations for queues in series , 2013 .

[25]  Tetsuya Takine,et al.  Sojourn time distribution in a MAP/M/1 processor-sharing queue , 2003, Oper. Res. Lett..

[26]  Ning Zhao,et al.  Analysis of a MAP/PH/1 queue with discretionary priority , 2015, WSC 2015.

[27]  Leon F. McGinnis,et al.  Compatibility of Queueing Theory, Manufacturing Systems and SEMI Standards , 2007, 2007 IEEE International Conference on Automation Science and Engineering.

[28]  Kan Wu,et al.  Taxonomy of batch queueing models in manufacturing systems , 2014, Eur. J. Oper. Res..

[29]  Ning Zhao,et al.  A two-stage discretionary priority service system with Markovian arrival inputs , 2010, 2010 IEEE International Conference on Industrial Engineering and Engineering Management.

[30]  Discretionary priority discipline: A reasonable compromise between preemptive and nonpreemptive disciplines , 1996 .

[31]  Kyung C. Chae,et al.  Discrete-time queues with discretionary priorities , 2010, Eur. J. Oper. Res..

[32]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[33]  Kan Wu,et al.  Classification of queueing models for a workstation with interruptions: a review , 2014 .

[34]  Markus Ettl,et al.  Sojourn Time and Waiting Time Distributions for M/GI/1 Queues with Preemption-Distance Priorities , 1994, Oper. Res..

[35]  Ning Zhao,et al.  A two-stage M/G/1 queue with discretionary priority , 2011, 2011 IEEE International Conference on Industrial Engineering and Engineering Management.

[36]  A. Alfa.  Matrix‐geometric solution of discrete time MAP/PH/1 priority queue , 1998 .

[37]  Attahiru Sule Alfa,et al.  Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue , 2003 .

[38]  W. D. Ray,et al.  Stochastic Models: An Algorithmic Approach , 1995 .

[39]  Lajos Takács,et al.  Priority queues , 2019, The Art of Multiprocessor Programming.