On the single-server queue with the preemptive-resume last-come–first-served queue discipline
From MaRDI portal
Publication:3719599
DOI10.2307/3214136zbMath0591.60091OpenAlexW2327649529MaRDI QIDQ3719599
No author found.
Publication date: 1986
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214136
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (6)
Stationary workload and service times for some nonwork-conserving M/G/1 preemptive LIFO queues ⋮ Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline ⋮ Duality relations for certain single server queues ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ The G/G/1 (LCFS/P) queue with service depending on queue size ⋮ Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
This page was built for publication: On the single-server queue with the preemptive-resume last-come–first-served queue discipline
