default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher Kirkbride
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Ugur Satic
, Peter Jacko, Christopher Kirkbride:
A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem. Eur. J. Oper. Res. 315(2): 454-469 (2024)- 2023
- [j9]Ben Black, Russell Ainslie, Trivikram Dokka, Christopher Kirkbride:
Distributionally robust resource planning under binomial demand intakes. Eur. J. Oper. Res. 306(1): 227-242 (2023) - 2022
- [j8]Ugur Satic, Peter Jacko, Christopher Kirkbride:
Performance evaluation of scheduling policies for the dynamic and stochastic resource-constrained multi-project scheduling problem. Int. J. Prod. Res. 60(4): 1411-1423 (2022)
2010 – 2019
- 2019
- [c2]Ugur Satic, Peter Jacko, Christopher Kirkbride:
Performance Evaluation of Scheduling Policies for the DRCMPSP. ASMTA 2019: 100-114 - 2017
- [j7]Mustafa Çimen, Christopher Kirkbride:
Approximate dynamic programming algorithms for multidimensional flexible production-inventory problems. Int. J. Prod. Res. 55(7): 2034-2050 (2017) - 2014
- [j6]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) - 2013
- [c1]Mustafa Çimen, Christopher Kirkbride:
Approximate Dynamic Programming Algorithms for Multidimensional Inventory Optimization Problems. MIM 2013: 2015-2020
2000 – 2009
- 2009
- [j5]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) - 2008
- [j4]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
- [j3]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) - [j2]Kevin D. Glazebrook, Christopher Kirkbride:
Dynamic routing to heterogeneous collections of unreliable servers. Queueing Syst. Theory Appl. 55(1): 9-25 (2007) - 2004
- [b1]Christopher Kirkbride:
Routing in multi-class queueing networks. University of Newcastle Upon Tyne, UK, 2004 - 2003
- [j1]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)
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 2024-08-23 18:27 CEST 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:
