Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines

DOI10.2307/3214103MaRDI QIDQ3768129zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

convex orderingconvex programming problemsergodic sojourn timeswork-conserving non-preemptive disciplines

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Convex ordering of the attained waiting times in single-server queues and related problems
• An extremal property of FIFO discipline in G/IFR/1 queues
• An extremal property of the fifo discipline via an ordinal version of
• From FIFO to LIFO: a functional ordering of service delay via arrival discipline
• On extremal service disciplines in single-stage queueing systems

Cited in

(14)

• A production system with two job classes, changeover times and revisitation
• On an elementary characterization of the increasing convex ordering, by an application
• From FIFO to LIFO: a functional ordering of service delay via arrival discipline
• An extremal property of FIFO discipline in G/IFR/1 queues
• Sample path methods in the control of queues
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• Optimal scheduling policies in time sharing service systems
• Effects of service disciplines in \(G/GI/s\) queueing systems
• Mathematical problems in the theory of processor-sharing queueing systems
• Optimal Scheduling of Multiclass Stochastic Systems
• Convex ordering of the attained waiting times in single-server queues and related problems
• Comparisons of service disciplines in a tandem queueing network with real time constraints
• Convex comparison of service disciplines in real time queues
• A comparison of three random disciplines

This page was built for publication: Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768129)