Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
From MaRDI portal
(Redirected from Publication:3635176)
Recommendations
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- Stochastic Scheduling in in-Forest Networks
Cited in
(12)- Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
- Personalized queues: the customer view, via a fluid model of serving least-patient first
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- QED limits for many-server systems under a priority policy
- Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control
- Control of patient flow in emergency departments, or multiclass queues with deadlines and feedback
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
- Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
- Price-coupled scheduling for differentiated services: Gcµversus GPS
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
This page was built for publication: Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635176)
