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.60095MaRDI 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 ordering; convex programming problems; ergodic sojourn times; work-conserving non-preemptive disciplines
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Optimal Scheduling of Multiclass Stochastic Systems, Mathematical problems in the theory of processor-sharing queueing systems, Effects of service disciplines in \(G/GI/s\) queueing systems, A comparison of three random disciplines, A production system with two job classes, changeover times and revisitation, Optimal scheduling policies in time sharing service systems, Sample path methods in the control of queues, Comparisons of service disciplines in a tandem queueing network with real time constraints, Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
