Kevin D. Glazebrook

Orcid: 0000-0002-5045-0718

Affiliations:
  • Lancaster University, Department of Management Science


According to our database1, Kevin D. Glazebrook authored at least 63 papers between 1981 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A stochastic game framework for patrolling a border.
Eur. J. Oper. Res., December, 2023

A Classical Search Game in Discrete Locations.
Math. Oper. Res., May, 2023

2021
Applications of stochastic modeling in air traffic management: Methods, challenges and opportunities for solving air traffic problems under uncertainty.
Eur. J. Oper. Res., 2021

2020
A Slot-Scheduling Mechanism at Congested Airports that Incorporates Efficiency, Fairness, and Airline Preferences.
Transp. Sci., 2020

Fast or Slow: Search in Discrete Locations with Two Search Modes.
Oper. Res., 2020

Adaptive policies for perimeter surveillance problems.
Eur. J. Oper. Res., 2020

On the dynamic allocation of assets subject to failure.
Eur. J. Oper. Res., 2020

2019
Resource allocation in congested queueing systems with time-varying demand: An application to airport operations.
Eur. J. Oper. Res., 2019

2017
Combinatorial Multi-Armed Bandits with Filtered Feedback.
CoRR, 2017

2016
Developing Effective Service Policies for Multiclass Queues with Abandonment: Asymptotic Optimality and Approximate Policy Improvement.
INFORMS J. Comput., 2016

On the Identification and Mitigation of Weaknesses in the Knowledge Gradient Policy for Multi-Armed Bandits.
CoRR, 2016

2014
How and When to Deploy Error Prone Sensors in Support of the Maintenance of Two-Phase Systems With Ageing.
IEEE Trans. Reliab., 2014

Stochastic scheduling: A short history of index policies and new approaches to index generation for dynamic resource allocation.
J. Sched., 2014

Effects of state-dependent balking on multi-server non-stationary queueing systems.
J. Oper. Res. Soc., 2014

2013
Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing.
OR Spectr., 2013

A Graph Patrol Problem with Random Attack Times.
Oper. Res., 2013

2012
Enhanced lateral transshipments in a multi-location inventory system.
Eur. J. Oper. Res., 2012

2011
A Dynamic Programming Policy Improvement Approach to the Development of Maintenance Policies for 2-Phase Systems With Aging.
IEEE Trans. Reliab., 2011

Dynamic resource allocation in a multi-product make-to-stock production system.
Queueing Syst. Theory Appl., 2011

Inventory models with lateral transshipments: A review.
Eur. J. Oper. Res., 2011

A Bayesian approach to the triage problem with imperfect classification.
Eur. J. Oper. Res., 2011

2010
The use of simple calibrations of individual locations in making transshipment decisions in a multi-location inventory network.
J. Oper. Res. Soc., 2010

2009
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements.
Math. Oper. Res., 2009

Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations.
Oper. Res., 2009

Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems.
Oper. Res., 2009

An index heuristic for transshipment decisions in multi-location inventory systems based on a pairwise decomposition.
Eur. J. Oper. Res., 2009

2008
Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population.
Manag. Sci., 2008

2007
Dynamic routing to heterogeneous collections of unreliable servers.
Queueing Syst. Theory Appl., 2007

Index Policies for Shooting Problems.
Oper. Res., 2007

2005
Fixed-time schedules for the processing of jobs when service completions are not observable.
Math. Methods Oper. Res., 2005

Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case.
Math. Methods Oper. Res., 2005

A static allocation model for the outsourcing of warranty repairs.
J. Oper. Res. Soc., 2005

Index policies for the maintenance of a collection of machines by a set of repairmen.
Eur. J. Oper. Res., 2005

2004
Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds.
Math. Oper. Res., 2004

Shoot-Look-Shoot: A Review and Extension.
Oper. Res., 2004

2003
Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs.
Queueing Syst. Theory Appl., 2003

An analysis of Klimov's problem with parallel servers.
Math. Methods Oper. Res., 2003

Whittle's index policy for a multi-class queueing system with convex holding costs.
Math. Methods Oper. Res., 2003

Generalised 'join the shortest queue' policies for the dynamic routing of jobs to multi-class queues.
J. Oper. Res. Soc., 2003

2002
The Dependence of Optimal Returns from Multi-class Queueing Systems on Their Customer Base.
Queueing Syst. Theory Appl., 2002

2001
Parallel Scheduling of Multiclass M/M/m Queues: Approximate and Heavy-Traffic Optimization of Achievable Performance.
Oper. Res., 2001

2000
Index Policies and a Novel Performance Space Structure for a Class of Generalised Branching Bandit Problems.
Math. Oper. Res., 2000

Allocation of tasks to specialized processors: A planning approach.
Eur. J. Oper. Res., 2000

1999
A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints.
J. Oper. Res. Soc., 1999

A linear programming approach to stability, optimisationand performance analysis for Markovian multiclassqueueing networks.
Ann. Oper. Res., 1999

Almost optimal policies for stochastic systemswhich almost satisfy conservation laws.
Ann. Oper. Res., 1999

1998
Stochastic Scheduling with Priority Classes.
Math. Oper. Res., 1998

On a new approach to the analysis of complex multi-armed bandits.
Math. Methods Oper. Res., 1998

Submodular Returns and Greedy Heuristics for Queueing Scheduling Problems.
Oper. Res., 1998

On stochastic machine scheduling with general distributional assumptions.
Eur. J. Oper. Res., 1998

1997
Bounds on optimal values in stochastic scheduling.
Oper. Res. Lett., 1997

Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule.
Proceedings of the Algorithms, 1997

1996
Server Allocation Subject to Variance Constraints.
Perform. Evaluation, 1996

1995
On the Value of Adaptive Solutions to Stochastic Scheduling Problems.
Math. Oper. Res., 1995

Stochastic Scheduling and Forwards Induction.
Discret. Appl. Math., 1995

1994
Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment.
Oper. Res., 1994

Simulation-based dynamic optimization: planning United States coast guard law enforcement patrols.
Proceedings of the 26th conference on Winter simulation, 1994

1992
On a "No Arrivals" Heuristic for Single Machine Stochastic Scheduling.
Oper. Res., 1992

1991
On the evaluation of strategies for branching bandit processes.
Ann. Oper. Res., 1991

Competing Markov decision processes.
Ann. Oper. Res., 1991

1990
Evaluating Strategies for Markov Decision Processes in Parallel.
Math. Oper. Res., 1990

1987
Sensitivity Analysis for Stochastic Scheduling Problems.
Math. Oper. Res., 1987

1981
On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs.
Oper. Res., 1981


  Loading...