On queues with impatience: stability, and the optimality of earliest deadline first
DOI10.1007/S11134-013-9342-1zbMATH Open1277.90034OpenAlexW1983111238MaRDI QIDQ386347FDOQ386347
Authors: Pascal Moyal 
Publication date: 9 December 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-013-9342-1
Recommendations
- Fluid limit of a heavily loaded EDF queue with impatient customers
- scientific article; zbMATH DE number 3858809
- STABILITY IN QUEUES WITH IMPATIENT CUSTOMERS
- The queue with impatience: construction of the stationary workload under FIFO
- On queueing with customer impatience until the beginning of service
Inequalities; stochastic orderings (60E15) Queues and service in operations research (90B22) Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Title not available (Why is that?)
- Title not available (Why is that?)
- Queuing with impatient customers and ordered service
- Fluid limits for processor-sharing queues with impatience
- Title not available (Why is that?)
- Single-server queues with impatient customers
- Stochastic Scheduling with Release Dates and Due Dates
- Heavy traffic analysis for EDF queues with reneging
- The fluid limit of a heavily loaded processor sharing queue
- Convex comparison of service disciplines in real time queues
- On optimal lateness and tardiness scheduling in real-time systems
- Two ergodicity criteria for stochastically recursive sequences
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- A functional central limit theorem for the \(M/GI/\infty \) queue
- Stochastic modeling and analysis of telecoms networks
- Fluid limit of a heavily loaded EDF queue with impatient customers
- The queue with impatience: construction of the stationary workload under FIFO
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Title not available (Why is that?)
- A Real-Time System Design Methodology*
- Stability of a Processor-Sharing Queue with Varying Throughput
Cited In (14)
- Increases or discounts: price strategies based on customers' patience times
- Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues
- Whittle index approach to multiserver scheduling with impatient customers and DHR service times
- Fluid limit of a heavily loaded EDF queue with impatient customers
- Law of large numbers for the many-server earliest-deadline-first queue
- A Skorokhod map on measure-valued paths with applications to priority queues
- Personalized queues: the customer view, via a fluid model of serving least-patient first
- Fluid limits for earliest-deadline-first networks
- Server assignment policies in queues with customer abandonments
- Coupling in the queue with impatience: case of several servers
- Improved EDD discipline in out-patient queuing systems
- The queue with impatience: construction of the stationary workload under FIFO
- Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
- On the probability of abandonment in queues with limited sojourn and waiting times
This page was built for publication: On queues with impatience: stability, and the optimality of earliest deadline first
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386347)
