Dynamic policies for uncertain time‐critical tasking problems
From MaRDI portal
Publication:3539891
DOI10.1002/NAV.20272zbMath1157.68019OpenAlexW2100155388MaRDI QIDQ3539891
E. L. Punton, Kevin D. Glazebrook
Publication date: 19 November 2008
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45064/1/10.pdf
Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (2)
Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement ⋮ An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
Cites Work
This page was built for publication: Dynamic policies for uncertain time‐critical tasking problems
