Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
communicationsearliest due dateimpatient customersM/G/1 queuesMarkov decision processesoptimal control of queuespacketized voiceshortest time to extinctionstochastic scheduling theory
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99) Discrete mathematics in relation to computer science (68R99) Queues and service in operations research (90B22)
- Optimal server scheduling in nonpreemptive finite-population queueing systems
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Stochastic scheduling with optimal customer service
- Optimally scheduling \(N\) customer arrival times for a single-server system
- Approximately optimal scheduling of an \(\mathrm{M}/\mathrm{G}/1\) queue with heavy tails
- Optimal allocation of a server between two queues with due times
- Scheduling in a multi-class series of queues with deterministic service times
- Convex comparison of service disciplines in real time queues
- On optimal lateness and tardiness scheduling in real-time systems
- Law of large numbers for the many-server earliest-deadline-first queue
- Personalized queues: the customer view, via a fluid model of serving least-patient first
- A Skorokhod map on measure-valued paths with applications to priority queues
- Two approaches to optimal routing and admission control in systems with real-time traffic
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Optimal scheduling policies in time sharing service systems
- Fluid limits for earliest-deadline-first networks
- Optimal Entering Rules for a Customer with Wait Option at an M/G/1 Queue
- Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Scheduling policies for an antiterrorist surveillance system
- Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
- scientific article; zbMATH DE number 4062796 (Why is no real title available?)
- On queues with impatience: stability, and the optimality of earliest deadline first
- Optimal allocation of a server between two queues with due times
- Further results for dynamic scheduling of multiclass G/G/1 queues
- Study of a scheduling policy for diverse deadline-based quality of service
- Scheduling services in a queuing system with impatience and setup costs
- Multiple server preemptive scheduling with impatience
- Approximate sorting of packet-scheduling in high-speed networks
- Random trees in queueing systems with deadlines
- Toward organ shortage resilient allocation policies using real-time queueing models for liver transplantation
- Optimal server scheduling in nonpreemptive finite-population queueing systems
This page was built for publication: Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829064)
