Priorities in  M / G /1 queue with server vacations | Zendy

Kella Offer | Zendy; Yechiali Uri | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Priorities in M / G /1 queue with server vacations

Author(s) -

Kella Offer,

Yechiali Uri

Publication year - 1988

Publication title -

naval research logistics (nrl)

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.665

H-Index - 68

eISSN - 1520-6750

pISSN - 0894-069X

DOI - 10.1002/1520-6750(198802)35:1<23::aid-nav3220350103>3.0.co;2-b

Subject(s) - queue , computer science , probabilistic logic , laplace transform , representation (politics) , laplace–stieltjes transform , queueing system , mathematical optimization , mathematics , computer network , artificial intelligence , mathematical analysis , fourier analysis , fourier transform , politics , political science , fractional fourier transform , law

The M/G /1 queue with single and multiple server vacations is studied under both the preemptive and non‐preemptive priority regimes. A unified methodology is developed to derive the Laplace‐Stieltjes transform and first two moments of the waiting time W k of a class‐ k customer for each of the four models analyzed. The results are given a probabilistic representation involving mean residual lifetimes.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research