default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin D. Glazebrook
Person information
- affiliation: Lancaster University, Department of Management Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j60]Rob Shone
, Kevin Glazebrook, Konstantinos G. Zografos:
A New Simheuristic Approach for Stochastic Runway Scheduling. Transp. Sci. 58(2): 520-539 (2024)- 2023
- [j59]Matthew Darlington, Kevin D. Glazebrook, David S. Leslie, Rob Shone, Roberto Szechtman:
A stochastic game framework for patrolling a border. Eur. J. Oper. Res. 311(3): 1146-1158 (2023) - [j58]Jake Clarkson, Kyle Y. Lin, Kevin D. Glazebrook:
A Classical Search Game in Discrete Locations. Math. Oper. Res. 48(2): 687-707 (2023) - 2022
- [i5]Matthew Darlington, Kevin D. Glazebrook, David S. Leslie, Rob Shone, Roberto Szechtman:
A stochastic game framework for patrolling a border. CoRR abs/2205.10017 (2022) - 2021
- [j57]Rob Shone, Kevin Glazebrook, Konstantinos G. Zografos:
Applications of stochastic modeling in air traffic management: Methods, challenges and opportunities for solving air traffic problems under uncertainty. Eur. J. Oper. Res. 292(1): 1-26 (2021) - [i4]Jake Clarkson, Kyle Y. Lin, Kevin D. Glazebrook:
A Classical Search Game in Discrete Locations. CoRR abs/2103.09310 (2021) - 2020
- [j56]James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford:
Adaptive policies for perimeter surveillance problems. Eur. J. Oper. Res. 283(1): 265-278 (2020) - [j55]Stephen Ford, Michael P. Atkinson, Kevin Glazebrook, Peter Jacko:
On the dynamic allocation of assets subject to failure. Eur. J. Oper. Res. 284(1): 227-239 (2020) - [j54]Jake Clarkson, Kevin D. Glazebrook, Kyle Y. Lin:
Fast or Slow: Search in Discrete Locations with Two Search Modes. Oper. Res. 68(2): 552-571 (2020) - [j53]Jamie Fairbrother, Konstantinos G. Zografos, Kevin D. Glazebrook:
A Slot-Scheduling Mechanism at Congested Airports that Incorporates Efficiency, Fairness, and Airline Preferences. Transp. Sci. 54(1): 115-138 (2020)
2010 – 2019
- 2019
- [j52]Rob Shone, Kevin Glazebrook, Konstantinos G. Zografos:
Resource allocation in congested queueing systems with time-varying demand: An application to airport operations. Eur. J. Oper. Res. 276(2): 566-581 (2019) - 2018
- [i3]James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman, Adam N. Letchford:
Adaptive Policies for Perimeter Surveillance Problems. CoRR abs/1810.02176 (2018) - 2017
- [i2]James A. Grant, David S. Leslie, Kevin Glazebrook, Roberto Szechtman:
Combinatorial Multi-Armed Bandits with Filtered Feedback. CoRR abs/1705.09605 (2017) - 2016
- [j51]Terry James, Kevin D. Glazebrook, Kyle Y. Lin:
Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement. INFORMS J. Comput. 28(2): 251-264 (2016) - [i1]James Edwards, Paul Fearnhead, Kevin D. Glazebrook:
On the Identification and Mitigation of Weaknesses in the Knowledge Gradient Policy for Multi-Armed Bandits. CoRR abs/1607.05970 (2016) - 2014
- [j50]Efi Chassioti, David J. Worthington, Kevin D. Glazebrook:
Effects of state-dependent balking on multi-server non-stationary queueing systems. J. Oper. Res. Soc. 65(2): 278-290 (2014) - [j49]Kevin D. Glazebrook, David J. Hodge, Christopher Kirkbride, R. J. Minty:
Stochastic scheduling: A short history of index policies and new approaches to index generation for dynamic resource allocation. J. Sched. 17(5): 407-425 (2014) - [j48]Andrew J. MacPherson, Kevin D. Glazebrook:
How and When to Deploy Error Prone Sensors in Support of the Maintenance of Two-Phase Systems With Ageing. IEEE Trans. Reliab. 63(1): 118-133 (2014) - 2013
- [j47]Kyle Y. Lin, Michael P. Atkinson, Timothy H. Chung, Kevin D. Glazebrook:
A Graph Patrol Problem with Random Attack Times. Oper. Res. 61(3): 694-710 (2013) - [j46]Li Ding, Kevin D. Glazebrook:
Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing. OR Spectr. 35(3): 585-608 (2013) - 2012
- [j45]Colin Paterson, Ruud H. Teunter, Kevin D. Glazebrook:
Enhanced lateral transshipments in a multi-location inventory system. Eur. J. Oper. Res. 221(2): 317-327 (2012) - 2011
- [j44]Colin Paterson, Gudrun P. Kiesmüller, Ruud H. Teunter, Kevin D. Glazebrook:
Inventory models with lateral transshipments: A review. Eur. J. Oper. Res. 210(2): 125-136 (2011) - [j43]Dong Li, Kevin D. Glazebrook:
A Bayesian approach to the triage problem with imperfect classification. Eur. J. Oper. Res. 215(1): 169-180 (2011) - [j42]David J. Hodge, Kevin D. Glazebrook:
Dynamic resource allocation in a multi-product make-to-stock production system. Queueing Syst. Theory Appl. 67(4): 333-364 (2011) - [j41]Andrew J. MacPherson, Kevin D. Glazebrook:
A Dynamic Programming Policy Improvement Approach to the Development of Maintenance Policies for 2-Phase Systems With Aging. IEEE Trans. Reliab. 60(2): 448-459 (2011) - 2010
- [j40]Thomas W. Archibald, D. P. Black, Kevin D. Glazebrook:
The use of simple calibrations of individual locations in making transshipment decisions in a multi-location inventory network. J. Oper. Res. Soc. 61(2): 294-305 (2010)
2000 – 2009
- 2009
- [j39]Thomas W. Archibald, D. P. Black, Kevin D. Glazebrook:
An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition. Eur. J. Oper. Res. 192(1): 69-78 (2009) - [j38]Thomas W. Archibald, D. P. Black, Kevin D. Glazebrook:
Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems. Oper. Res. 57(2): 314-326 (2009) - [j37]Kevin D. Glazebrook, Christopher Kirkbride, Jamal Ouenniche:
Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations. Oper. Res. 57(4): 975-989 (2009) - [j36]Kevin D. Glazebrook, R. J. Minty:
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements. Math. Oper. Res. 34(1): 26-44 (2009) - 2008
- [j35]Li Ding, Kevin D. Glazebrook, Christopher Kirkbride:
Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population. Manag. Sci. 54(3): 594-607 (2008) - 2007
- [j34]Kevin D. Glazebrook, Christopher Kirkbride, H. M. Mitchell, Donald P. Gaver, Patricia A. Jacobs:
Index Policies for Shooting Problems. Oper. Res. 55(4): 769-781 (2007) - [j33]Kevin D. Glazebrook, Christopher Kirkbride:
Dynamic routing to heterogeneous collections of unreliable servers. Queueing Syst. Theory Appl. 55(1): 9-25 (2007) - 2005
- [j32]Kevin D. Glazebrook, H. M. Mitchell, P. S. Ansell:
Index policies for the maintenance of a collection of machines by a set of repairmen. Eur. J. Oper. Res. 165(1): 267-284 (2005) - [j31]L. Ding, Kevin D. Glazebrook:
A static allocation model for the outsourcing of warranty repairs. J. Oper. Res. Soc. 56(7): 825-835 (2005) - [j30]Kevin D. Glazebrook:
Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case. Math. Methods Oper. Res. 61(1): 147-169 (2005) - [j29]Kevin D. Glazebrook, Emma L. Punton:
Fixed-time schedules for the processing of jobs when service completions are not observable. Math. Methods Oper. Res. 62(1): 77-97 (2005) - 2004
- [j28]Kevin D. Glazebrook, Alan Washburn:
Shoot-Look-Shoot: A Review and Extension. Oper. Res. 52(3): 454-463 (2004) - [j27]R. T. Dunn, Kevin D. Glazebrook:
Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds. Math. Oper. Res. 29(2): 266-279 (2004) - 2003
- [j26]P. S. Ansell, Kevin D. Glazebrook, Christopher Kirkbride:
Generalised 'join the shortest queue' policies for the dynamic routing of jobs to multi-class queues. J. Oper. Res. Soc. 54(4): 379-389 (2003) - [j25]P. S. Ansell, Kevin D. Glazebrook, José Niño-Mora, M. O'Keeffe:
Whittle's index policy for a multi-class queueing system with convex holding costs. Math. Methods Oper. Res. 57(1): 21-39 (2003) - [j24]Kevin D. Glazebrook:
An analysis of Klimov's problem with parallel servers. Math. Methods Oper. Res. 58(1): 1-28 (2003) - [j23]Kevin D. Glazebrook, R. R. Lumley, P. S. Ansell:
Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs. Queueing Syst. Theory Appl. 45(2): 81-111 (2003) - 2002
- [j22]M. J. Dacre, Kevin D. Glazebrook:
The Dependence of Optimal Returns from Multi-class Queueing Systems on Their Customer Base. Queueing Syst. Theory Appl. 40(1): 93-115 (2002) - 2001
- [j21]Kevin D. Glazebrook, José Niño-Mora:
Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance. Oper. Res. 49(4): 609-623 (2001) - 2000
- [j20]K. J. Becker, Donald P. Gaver, Kevin D. Glazebrook, Patricia A. Jacobs, Siriphong Lawphongpanich:
Allocation of tasks to specialized processors: A planning approach. Eur. J. Oper. Res. 126(1): 80-88 (2000) - [j19]J. H. Crosbie, Kevin D. Glazebrook:
Index Policies and a Novel Performance Space Structure for a Class of Generalised Branching Bandit Problems. Math. Oper. Res. 25(2): 281-297 (2000)
1990 – 1999
- 1999
- [j18]Kevin D. Glazebrook, José Niño-Mora:
A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks. Ann. Oper. Res. 92: 1-18 (1999) - [j17]Kevin D. Glazebrook, Renate Garbe:
Almost optimal policies for stochastic systemswhich almost satisfy conservation laws. Ann. Oper. Res. 92: 19-43 (1999) - [j16]P. S. Ansell, Kevin D. Glazebrook, Isi Mitrani, José Niño-Mora:
A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints. J. Oper. Res. Soc. 50(7): 765-773 (1999) - 1998
- [j15]Wei Li, Kevin D. Glazebrook:
On stochastic machine scheduling with general distributional assumptions. Eur. J. Oper. Res. 105(3): 525-536 (1998) - [j14]Renate Garbe, Kevin D. Glazebrook:
Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems. Oper. Res. 46(3): 336-346 (1998) - [j13]Renate Garbe, Kevin D. Glazebrook:
On a new approach to the analysis of complex multi-armed bandits. Math. Methods Oper. Res. 48(3): 419-442 (1998) - [j12]Renate Garbe, Kevin D. Glazebrook:
Stochastic Scheduling with Priority Classes. Math. Oper. Res. 23(1): 119-144 (1998) - 1997
- [j11]John R. Birge, Kevin D. Glazebrook:
Bounds on optimal values in stochastic scheduling. Oper. Res. Lett. 21(3): 107-114 (1997) - [c2]Kevin D. Glazebrook, José Niño-Mora:
Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule. ESA 1997: 232-245 - 1996
- [j10]P. S. Ansell, Kevin D. Glazebrook, Isi Mitrani:
Server Allocation Subject to Variance Constraints. Perform. Evaluation 27/28(4): 147-158 (1996) - 1995
- [j9]Kevin D. Glazebrook:
Stochastic Scheduling and Forwards Induction. Discret. Appl. Math. 57(2-3): 145-165 (1995) - [j8]Kevin D. Glazebrook, R. W. Owen:
On the Value of Adaptive Solutions to Stochastic Scheduling Problems. Math. Oper. Res. 20(1): 65-89 (1995) - 1994
- [j7]I. Benkherouf, Kevin D. Glazebrook, R. W. Owen:
Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment. Oper. Res. 42(6): 1087-1099 (1994) - [c1]Michael P. Bailey, Kevin D. Glazebrook, Robert F. Dell:
Simulation-based dynamic optimization: planning United States coast guard law enforcement patrols. WSC 1994: 392-398 - 1992
- [j6]N. A. Fay, Kevin D. Glazebrook:
On a "No Arrivals" Heuristic for Single Machine Stochastic Scheduling. Oper. Res. 40(1): 168-177 (1992) - 1991
- [j5]Kevin D. Glazebrook:
Competing Markov decision processes. Ann. Oper. Res. 29(1): 537-563 (1991) - [j4]Kevin D. Glazebrook, Richard J. Boys, N. A. Fay:
On the evaluation of strategies for branching bandit processes. Ann. Oper. Res. 30(1): 299-319 (1991) - 1990
- [j3]Kevin D. Glazebrook, N. A. Fay:
Evaluating Strategies for Markov Decision Processes in Parallel. Math. Oper. Res. 15(1): 17-32 (1990)
1980 – 1989
- 1987
- [j2]Kevin D. Glazebrook:
Sensitivity Analysis for Stochastic Scheduling Problems. Math. Oper. Res. 12(2): 205-223 (1987) - 1981
- [j1]Kevin D. Glazebrook, J. C. Gittins:
On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs. Oper. Res. 29(1): 161-173 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
