An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling
From MaRDI portal
Publication:4849307
DOI10.1057/JORS.1995.123zbMath0837.90053OpenAlexW2089842263MaRDI QIDQ4849307
Phadhana Tosirisuk, Jeya Chandra
Publication date: 13 May 1996
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1995.123
single servermean waiting timesmultiple finite source queueing modeldynamic, non- preemptive priority service discipline
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
A survey of the machine interference problem ⋮ Multiple finite source queueing model with dynamic priority scheduling
This page was built for publication: An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling
