The effect of service time variability on maximum queue lengths in MX/G/1 queues
From MaRDI portal
Publication:3367759
DOI10.1239/jap/1127322037zbMath1084.60055arXivmath/0403318OpenAlexW2148113465MaRDI QIDQ3367759
Misja Nuyens, Ger Koole, Rhonda Righter
Publication date: 26 January 2006
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0403318
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Single-machine scheduling with exponential processing times and general stochastic cost functions
- COMPARISON OF QUEUES WITH DIFFERENT DISCRETE-TIME ARRIVAL PROCESSES
- Stochastic scheduling subject to machine breakdowns: The preemptive-repeat model with discounted reward and other criteria
- Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
- Monotonicity of the Loss Probabilities of Single Server Finite Queues with Respect to Convex Order of Arrival or Service Processes
- Stochastic convexity for multidimensional processes and its applications
- On an elementary characterization of the increasing convex ordering, by an application
- Single-machine scheduling subject to stochastic breakdowns
- Complementary generating functions for theMX/GI/1/kandGI/My/1/Kqueues and their application to the comparison of loss probabilities
