On queues with impatience: stability, and the optimality of earliest deadline first

DOI10.1007/S11134-013-9342-1MaRDI QIDQ386347zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

earliest deadline firstqueues with impatient customersstochastic recursive sequences

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3858809 (Why is no real title available?)
• scientific article; zbMATH DE number 3723657 (Why is no real title available?)
• scientific article; zbMATH DE number 1416816 (Why is no real title available?)
• scientific article; zbMATH DE number 3322728 (Why is no real title available?)
• A Real-Time System Design Methodology^*
• A functional central limit theorem for the \(M/GI/\infty \) queue
• Convex comparison of service disciplines in real time queues
• Fluid limit of a heavily loaded EDF queue with impatient customers
• Fluid limits for processor-sharing queues with impatience
• Heavy traffic analysis for EDF queues with reneging
• On optimal lateness and tardiness scheduling in real-time systems
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Queuing with impatient customers and ordered service
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Single-server queues with impatient customers
• Stability of a Processor-Sharing Queue with Varying Throughput
• Stochastic Scheduling with Release Dates and Due Dates
• Stochastic modeling and analysis of telecoms networks
• The fluid limit of a heavily loaded processor sharing queue
• The queue with impatience: construction of the stationary workload under FIFO
• Two ergodicity criteria for stochastically recursive sequences

Cited in

(14)

• Law of large numbers for the many-server earliest-deadline-first queue
• Whittle index approach to multiserver scheduling with impatient customers and DHR service times
• Fluid limits for earliest-deadline-first networks
• On the probability of abandonment in queues with limited sojourn and waiting times
• Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
• Coupling in the queue with impatience: case of several servers
• Fluid limit of a heavily loaded EDF queue with impatient customers
• Improved EDD discipline in out-patient queuing systems
• The queue with impatience: construction of the stationary workload under FIFO
• Increases or discounts: price strategies based on customers' patience times
• Personalized queues: the customer view, via a fluid model of serving least-patient first
• Server assignment policies in queues with customer abandonments
• A Skorokhod map on measure-valued paths with applications to priority queues
• Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues

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)