An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

Naval Research Logistics

Volumn 57, Issue 3, 2010, Pages 225-236

  Li, Dong ^a   Glazebrook, Kevin D ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Approximate dynamic programming; Fluid models; Heuristic policies; Impatient jobs; Stochastic scheduling

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; ASYMPTOTICALLY OPTIMAL; FLUID MODELS; HEURISTIC POLICIES; JOB LOSS; NON-PREEMPTIVE; NUMERICAL STUDIES; POOR PERFORMANCE; SINGLE SERVER; STATIC PRIORITY; STOCHASTIC SCHEDULING; VALUE FUNCTIONS;

DYNAMIC PROGRAMMING; EMPLOYMENT; PLASMA FLOW; SCHEDULING; STOCHASTIC SYSTEMS;

STOCHASTIC MODELS;

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

References (24)

1. P.S. Ansell, K.D. Glazebrook, and C. Kirkbride, Generalised join the shortest queue policies for the dynamic routing of jobs to multi-class queues, J Oper Res Soc 54 (2003), 379-389.
2. N.T.Argon, S. Ziya, and R. Righter, Scheduling impatient jobs in a clearing system with insights on patients triage in mass casualty incidents, Probabil Eng Information Sci 22 (2008), 301-332.
3. 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, Queue Systems 51 (2005), 249-285. (Pubitemid 41813334)
4. S. Bhulai, Dynamic routing policies for multiskill call centers, Probabil Eng Information Sci 23 (2009), 101-119.
5. S. Bhulai and G. Koole, On the structure of value functions for threshold policies in queueing models, J Appl Probabil 40 (2003), 613-622. (Pubitemid 37374281)
6. B. Doytchinov, J.P. Lehoczky, and S. Shreve, Real-time queues in heavy traffic with earliest-deadline-first queue discipline, The Annals of Applied Probabil 11 (2001), 332-378. (Pubitemid 33330104)
7. O. Garnett, A. Mandelbaum, and M.I. Reiman, Designing a call center with impatient customers, Manufactur Service Oper Manage 4 (2002), 208-227.
8. D.P.Gaver and P.A. Jacobs, Servicing impatient tasks that have uncertain outcomes, Technical Report, Naval Postgraduate School, Monterey, CA, 2000.
9. D.P. Gaver, P.A. Jacobs, G. Samorodnitsky, and K.D. Glazebrook, Modeling and analysis of uncertain time-critical tasking problems, Naval Res Logistics 53 (2006), 588-599. (Pubitemid 44329210)
10. K.D. Glazebrook, On stochastic scheduling problems with due dates, Int J Systems Sci 14 (1983), 1259-1271. (Pubitemid 14469924)
11. K.D. Glazebrook, P.S. Ansell, R.T. Dunn, and R.R. Lumley, On the optimal allocation of service to impatient tasks, J Appl Probabil 41 (2004), 51-72.
12. K.D. Glazebrook and E.L. Punton, Dynamic policies for uncertain time-critical tasking problems, Naval Res Logistics 55 (2008), 142-155.
13. K.D. Glazebrook, C. Kirkbride, and J. Ouenniche, Index policies for the admission control and routing of impatient customers to heterogeneous service stations, Oper Res 57 (2009), 975-989.
14. Z. Jiang, T.G. Lewis, and J.Y. Colin, Scheduling hard real-time constrained periodic tasks on multiple processors, J Systems Software 19 (1996), 102-118.
15. G. Koole, Introduction to the special issue on call center management, Manage Sci 54 (2008), 237.
16. P. Marbach, O. Mihatsch, and J.N. Tsitsiklis, Call admission control and routing in integrated services networks using neuro-dynamic programming, IEEE J Select Areas Commun 18 (2000), 197-208. (Pubitemid 30584805)
17. M. Opp, K. Glazebrook, and V.G. Kulkarni, Outsourcing warranty repairs: Dynamic allocation, Naval Res Logistics 52 (2005), 381-396. (Pubitemid 41228464)
18. T.J. Ott and K.R. Krishnan, Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic, Ann Oper Res 35 (1992), 43-68.
19. W.B. Powell, Approximate dynamic programming: Solving the curses of dimensionality, Wiley, Hoboken, New Jersey, 2007.
20. M.L. Puterman, Markov decision processes: Discrete stochastic dynamic programming, Wiley, New York, 1994.
21. D. Roubos and S. Bhulai, Average-cost approximate dynamic programming for the control of birth-death processes, Technical Report, VU University, Amsterdam, NL, 2007.
22. D. Roubos and S. Bhulai, Approximate dynamic programming techniques for the control of time-varying queueing systems applied to call centers with abandonments and retrials, Technical Report, VU University, Amsterdam, NL, 2009.
23. H.C. Tijms, Stochastic models: An algorithmic approach, Wiley, Chichester, 1994.
24. J. Van Mieghem, Due-date scheduling: asymptotic optimality of generalized longest queue and generalized largest delay rules, Oper Res 51 (2003), 113-122.