Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines
From MaRDI portal
Publication:3768129
DOI10.2307/3214103zbMath0631.60095OpenAlexW2323381724MaRDI QIDQ3768129
J. George Shanthikumar, Ushio Sumita
Publication date: 1987
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214103
convex orderingconvex programming problemsergodic sojourn timeswork-conserving non-preemptive disciplines
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
A comparison of three random disciplines ⋮ Comparisons of service disciplines in a tandem queueing network with real time constraints ⋮ Optimal scheduling policies in time sharing service systems ⋮ Sample path methods in the control of queues ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ A production system with two job classes, changeover times and revisitation ⋮ Optimal Scheduling of Multiclass Stochastic Systems ⋮ Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures ⋮ Effects of service disciplines in \(G/GI/s\) queueing systems
This page was built for publication: Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines
