An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
DOI10.1002/NAV.20395zbMATH Open1188.90118OpenAlexW2064179952MaRDI QIDQ3553742FDOQ3553742
Authors:
Publication date: 21 April 2010
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45362/1/10.pdf
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
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate Dynamic Programming
- On the optimal allocation of service to impatient tasks
- SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
- DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS
- 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
- 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
- On stochastic scheduling problems with due dates
- Approximate dynamic programming techniques for the control of time-varying queuing systems applied to call centers with abandonments and retrials
- On the structure of value functions for threshold policies in queueing models
- Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues
- Outsourcing warranty repairs: Dynamic allocation
- Dynamic policies for uncertain time‐critical tasking problems
- Modeling and analysis of uncertain time-critical tasking problems
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)
