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
DOI10.1002/nav.20395zbMath1188.90118OpenAlexW2064179952MaRDI QIDQ3553742
No author found.
Publication date: 21 April 2010
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45362/1/10.pdf
Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)
Related Items (9)
A medical resource allocation model for serving emergency victims with deteriorating health conditions ⋮ 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 ⋮ Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement ⋮ A Bayesian approach to the triage problem with imperfect classification ⋮ Mass casualty management in disaster scene: a systematic review of OR\&MS research in humanitarian operations ⋮ Triage Scheduling Optimization for Mass Casualty and Disaster Response ⋮ Multi-agent reinforcement learning algorithm to solve a partially-observable multi-agent problem in disaster response ⋮ Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic routing and admission control in high-volume service systems: Asymptotic analysis via multi-scale fluid limits
- Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations
- Modeling and analysis of uncertain time-critical tasking problems
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- Dynamic policies for uncertain time‐critical tasking problems
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
- Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
- On stochastic scheduling problems with due dates
- On the structure of value functions for threshold policies in queueing models
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- On the optimal allocation of service to impatient tasks
- APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR THE CONTROL OF TIME-VARYING QUEUING SYSTEMS APPLIED TO CALL CENTERS WITH ABANDONMENTS AND RETRIALS
- Approximate Dynamic Programming
- Outsourcing warranty repairs: Dynamic allocation
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
