Modeling and analysis of uncertain time-critical tasking problems

DOI10.1002/NAV.20162MaRDI QIDQ3423284zbMATH OpenOpenAlexFDO

Authors P. A. Jacobs, Gennady Samorodnitsky, D. P. jun. Gaver, Kevin D. Glazebrook

Publication date 20 February 2007

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20162

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Dynamic policies for uncertain time‐critical tasking problems
• Worst-case relative regret algorithm for task allocation in complex operation system
• On the optimal allocation of service to impatient tasks
• Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case
• Allocation of tasks to specialized processors: A planning approach

Cited in

(6)

• Developing effective service policies for multiclass queues with abandonment: asymptotic optimality and approximate policy improvement
• Dynamic policies for uncertain time‐critical tasking problems
• An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system
• Scheduling policies for an antiterrorist surveillance system
• A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework
• DES and RES processes and their explicit solutions

This page was built for publication: Modeling and analysis of uncertain time-critical tasking problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423284)