Dynamic policies for uncertain time-critical tasking problems

Naval Research Logistics

Volumn 55, Issue 2, 2008, Pages 142-155

  Glazebrook, Kevin D ^a   Punton, Emma L ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Dynamic programming; Heuristic dynamic policies; Service control problems

Indexed keywords

DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

HEURISTIC DYNAMIC POLICIES; POLICY IMPROVEMENT; SERVICE CONTROL PROBLEMS;

UNCERTAIN SYSTEMS;

EID: 41449101405     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20272     Document Type: Article

References (17)

1. F. Baccelli, P. Boyer, and G. Hebuterne, Single-server queues with impatient customers, Adv Appl Prob 16 (1984), 887-905.
2. A. Bassamboo, J.M. Harrison, and A. Zeevi, Dynamic routing and admission control in high-volume service systems: asymptotic analysis via multi-scale fluid limits, Queueing Syst 51 (2005), 249-285.
3. S.D. Deshmukh and S. Jain, Capacity design and service quality control in a queueing system, Oper Res 25 (1977), 651-661.
4. B. Doytchinov, J.P. Lehoczky, and S. Shreve, Real-time queues in heavy traffic with earliest-deadline-first queue discipline, Ann Appl Probab 11 (2001), 332-378.
5. O. Garnett, A. Mandelbaum, and M. Reiman, Designing a call center with impatient customers, Manuf Service Oper Mgmt 4 (2002), 208-227.
6. D.P. Gaver, P.A. Jacobs, G. Samorodnitsky, and K.D. Glazebrook, Modeling and analysis of uncertain time-critical tasking problems, Nav Res Logist 53 (2006), 588-599.
7. D.P. Gaver, P.A. Jacobs, and H. Sato, Assessing resource requirements for maritime domain awareness and protection (security). Working Paper, Department of Operations Research, Naval Postgraduate School, Monterey, CA, 2006.
8. K.D. Glazebrook, Stochastic scheduling with due dates, Int J Syst Sci 14(1983), 1259-1271.
9. K.D. Glazebrook, P.S. Ansell, R.T. Dunn, and R.R. Lumley, On the optimal allocation of service to impatient tasks, J Appl Prob 41 (2004), 51-72.
10. K.D. Glazebrook and E.L. Punton, Fixed-time schedules for the processing of jobs when service completions are not observable, Math Meth Oper Res 62 (2005), 77-97.
11. J.M. Harrison and A. Zeevi, Dynamic scheduling of a multiclass queue in the Halfin-Whitt heavy traffic regime, Oper Res 52 (2004), 243-257.
12. Z. Jiang, T.G. Lewis, and J.Y. Colin, Scheduling hard real-time constrained periodic tasks on multiple processors, J Syst Software 19 (1996), 102-118.
13. K.R. Krishnan, "Joining the right queue: A Markov decision rule," in: Proceedings of the 28th IEEE Conference on Decision Control, 1987, pp. 1863-1868.
14. J.P. Lehoczky, "Real-time queueing theory," in: Proceedings of the 17th IEEE Real-Time Systems Symposium, 1996, pp. 186-195.
15. J.P. Lehoczky, "Real-time queueing network theory," in: Proceedings of the 18th IEEE Real-Time Systems Symposium, 1997, pp. 58-67.
16. J.P. Lehoczky, Using real-time queueing theory to control lateness in real-time systems, Perform Eval Rev 25 (1997), 158-168.
17. H.C. Tijms, Stochastic models: An algorithmic approach, Wiley, Chichester, 1994.