Explicit formulas are derived for mean waiting times of each class in preemptive-resume and nonpreemptive priority queues with K independent batch Markovian arrival streams having geometrically distributed idle periods and general service times.
Journal of the Operations Research Society of Japan39, 266–290 (1996)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Mean Waiting Times in Discrete-Time Priority Queues with Geometrically Distributed Idle Periods
Explicit formulas are derived for mean waiting times of each class in preemptive-resume and nonpreemptive priority queues with K independent batch Markovian arrival streams having geometrically distributed idle periods and general service times.