Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service

DOI10.1145/48014.48019zbMath0674.68023OpenAlexW2072906481MaRDI QIDQ3829064

S. Panwar, Don Towsley, Jack Keil Wolf

Publication date: 1988

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/48014.48019

zbMATH Keywords

Markov decision processesimpatient customerscommunicationsM/G/1 queuesearliest due datepacketized voiceoptimal control of queuesshortest time to extinctionstochastic scheduling theory

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Related Items (14)

Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline ⋮ Law of large numbers for the many-server earliest-deadline-first queue ⋮ Two approaches to optimal routing and admission control in systems with real-time traffic ⋮ Personalized queues: the customer view, via a fluid model of serving least-patient first ⋮ Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time ⋮ On queues with impatience: stability, and the optimality of earliest deadline first ⋮ MULTIPLE SERVER PREEMPTIVE SCHEDULING WITH IMPATIENCE ⋮ Fluid limits for earliest-deadline-first networks ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ On optimal lateness and tardiness scheduling in real-time systems ⋮ Random trees in queueing systems with deadlines ⋮ A Skorokhod map on measure-valued paths with applications to priority queues ⋮ Approximate sorting of packet-scheduling in high-speed networks ⋮ Convex comparison of service disciplines in real time queues

This page was built for publication: Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service