Sojourn times in a random queue with and without preemption

DOI10.1016/S0377-2217(97)00407-4zbMath0933.90013OpenAlexW2089358056MaRDI QIDQ1806681

A. J. Field, Peter G. Harrison

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00407-4

zbMATH Keywords

Laplace-Stieltjes transformssojourn time distributionsrandom queueing

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• A comparison of three random disciplines
• Numerical Inversion of Laplace Transforms of Probability Distributions
• Queues with Service in Random Order
• Waiting Time Distributions for Processor-Sharing Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Sojourn times in a random queue with and without preemption