An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
From MaRDI portal
Publication:3553742
Recommendations
- Optimal static priority rules for stochastic scheduling with impatience
- On the optimal allocation of service to impatient tasks
- A sequential scheduling problem with impatient jobs
- Myopic policies for non-preemptive scheduling of jobs with decaying value
- Scheduling in a single-server queue with state-dependent service rates
Cites work
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- Approximate Dynamic Programming
- Approximate dynamic programming techniques for the control of time-varying queuing systems applied to call centers with abandonments and retrials
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
- Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
- Dynamic policies for uncertain time‐critical tasking problems
- Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
- Modeling and analysis of uncertain time-critical tasking problems
- On stochastic scheduling problems with due dates
- On the optimal allocation of service to impatient tasks
- On the structure of value functions for threshold policies in queueing models
- Outsourcing warranty repairs: Dynamic allocation
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
Cited in
(12)- A Bayesian approach to the triage problem with imperfect classification
- Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- A sequential scheduling problem with impatient jobs
- Mass casualty management in disaster scene: a systematic review of OR\&MS research in humanitarian operations
- A medical resource allocation model for serving emergency victims with deteriorating health conditions
- Multi-agent reinforcement learning algorithm to solve a partially-observable multi-agent problem in disaster response
- Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- Triage scheduling optimization for mass casualty and disaster response
- Myopic policies for non-preemptive scheduling of jobs with decaying value
- Developing effective service policies for multiclass queues with abandonment: asymptotic optimality and approximate policy improvement
This page was built for publication: An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553742)
