default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan-Kees C. W. van Ommeren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j30]Niek Baer, Ahmad Al Hanbali
, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
A successive censoring algorithm for a system of connected LDQBD-processes. Ann. Oper. Res. 310(2): 389-410 (2022)- [j29]Adriana F. Gabor, Jan-Kees C. W. van Ommeren, Andrei Sleptchenko:
An inventory model with discounts for omnichannel retailers of slow moving items. Eur. J. Oper. Res. 300(1): 58-72 (2022) - 2021
- [j28]Anna Oblakova, Ahmad Al Hanbali, Richard J. Boucherie, Jan-Kees C. W. van Ommeren, W. H. M. Zijm:
Roots, Symmetry, and Contour Integrals in Queuing-Type Systems. SIAM J. Appl. Math. 81(5): 2265-2295 (2021) - 2020
- [j27]Jan-Kees C. W. van Ommeren, Ahmad Al Hanbali, Richard J. Boucherie:
Analysis of polling models with a self-ruling server. Queueing Syst. Theory Appl. 94(1-2): 77-107 (2020) - [j26]Jan-Kees C. W. van Ommeren, Niek Baer, Nishant Mishra, Debjit Roy:
Batch service systems with heterogeneous servers. Queueing Syst. Theory Appl. 95(3): 251-269 (2020)
2010 – 2019
- 2019
- [j25]Anna Oblakova, Ahmad Al Hanbali, Richard J. Boucherie, Jan-Kees C. W. van Ommeren, W. H. M. Zijm:
An exact root-free method for the expected queue length for a class of discrete-time queueing systems. Queueing Syst. Theory Appl. 92(3-4): 257-292 (2019) - [j24]Maurits de Graaf, Richard J. Boucherie, Johann L. Hurink, Jan-Kees C. W. van Ommeren:
An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random Struct. Algorithms 55(1): 89-103 (2019) - [j23]Niek Baer, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
Threshold Queueing to Describe the Fundamental Diagram of Uninterrupted Traffic. Transp. Sci. 53(2): 585-596 (2019) - 2017
- [j22]Sajjad Rahimi-Ghahroodi, Ahmad Al Hanbali, W. H. M. Zijm, Jan-Kees C. W. van Ommeren, Andrei Sleptchenko:
Integrated planning of spare parts and service engineers with partial backlogging. OR Spectr. 39(3): 711-748 (2017) - [j21]Mihaela Mitici, Jasper Goseling, Jan-Kees C. W. van Ommeren, Maurits de Graaf, Richard J. Boucherie:
On a tandem queue with batch service and its applications in wireless sensor networks. Queueing Syst. Theory Appl. 87(1-2): 81-93 (2017) - [j20]Nishant Mishra, Debjit Roy, Jan-Kees C. W. van Ommeren:
A Stochastic Model for Interterminal Container Transportation. Transp. Sci. 51(1): 67-87 (2017) - 2016
- [j19]Maurits de Graaf, Richard J. Boucherie, Johann L. Hurink, Jan-Kees C. W. van Ommeren:
Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases. EAI Endorsed Trans. Energy Web 3(10): e5 (2016) - [j18]Jasper Goseling, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
A linear programming approach to error bounds for random walks in the quarter-plane. Kybernetika 52(5): 757-784 (2016) - [j17]Lars A. van Vianen, Adriana F. Gabor, Jan-Kees C. W. van Ommeren:
Waiting times in classical priority queues via elementary lattice path counting. Queueing Syst. Theory Appl. 84(3-4): 295-307 (2016) - 2015
- [j16]Wanrong Ju, Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
An approximate policy for a dual-sourcing inventory model with positive lead times and binomial yield. Eur. J. Oper. Res. 244(2): 490-497 (2015) - 2014
- [c7]Niek Baer, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
The PH/PH/1 Multi-threshold Queue. ASMTA 2014: 95-109 - 2013
- [j15]Jasper Goseling, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
Energy-delay tradeoff in a two-way relay with network coding. Perform. Evaluation 70(11): 981-994 (2013) - 2012
- [j14]Ahmad Al Hanbali, Roland de Haan, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
Time-limited polling systems with batch arrivals and phase-type service times. Ann. Oper. Res. 198(1): 57-82 (2012) - [j13]Peter J. H. Hulshof, Peter T. Vanberkel, Richard J. Boucherie, Erwin W. Hans, Mark van Houdenhoven, Jan-Kees C. W. van Ommeren:
Analytical models to determine room requirements in outpatient clinics. OR Spectr. 34(2): 391-405 (2012) - [i1]Mihaela Mitici, Martijn Onderwater, Maurits de Graaf, Jan-Kees C. W. van Ommeren, Nico M. van Dijk, Jasper Goseling:
An Optimal Query Assignment for Wireless Sensor Networks. CoRR abs/1212.5378 (2012) - 2011
- [j12]Edmund K. Burke, Timothy Curtois, L. F. van Draat, Jan-Kees C. W. van Ommeren, Gerhard F. Post:
Progress control in iterated local search for nurse rostering. J. Oper. Res. Soc. 62(2): 360-367 (2011) - 2010
- [j11]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
A new approximation algorithm for the multilevel facility location problem. Discret. Appl. Math. 158(5): 453-460 (2010) - [c6]Tom Coenen, Jan-Kees C. W. van Ommeren, Maurits de Graaf:
Routing versus energy optimization in a linear network. ARCS Workshops 2010: 253-258
2000 – 2009
- 2009
- [j10]Roland de Haan, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
A polling model with an autonomous server. Queueing Syst. Theory Appl. 62(3): 279-308 (2009) - 2008
- [c5]Ahmad Al Hanbali, Roland de Haan, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks. ASMTA 2008: 189-205 - [c4]Ahmad Al Hanbali, Roland de Haan, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
Time-limited and k-limited polling systems: a matrix analytic solution. VALUETOOLS 2008: 17 - 2007
- [j9]Edwin Woudt, Pieter-Tjerk de Boer, Jan-Kees C. W. van Ommeren:
Improving Adaptive Importance Sampling Simulation of Markovian Queueing Models using Non-parametric Smoothing. Simul. 83(12): 811-820 (2007) - [c3]Roland de Haan, Richard J. Boucherie, Jan-Kees C. W. van Ommeren:
The Impact of Interference on Optimal Multi-path Routing in Ad Hoc Networks. ITC 2007: 803-815 - 2006
- [j8]Jan-Kees C. W. van Ommeren, Adriana Felicia Bumb, Andrei Sleptchenko:
Locating repair shops in a stochastic environment. Comput. Oper. Res. 33: 1575-1594 (2006) - [j7]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
An approximation algorithm for a facility location problem with stochastic demands and inventories. Oper. Res. Lett. 34(3): 257-263 (2006) - [j6]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
Approximation algorithms for facility location problems with a special class of subadditive cost functions. Theor. Comput. Sci. 363(3): 289-300 (2006) - [c2]Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. AAIM 2006: 207-219 - 2005
- [j5]Lieneke Spanjers, Jan-Kees C. W. van Ommeren, W. H. M. Zijm:
Closed loop two-echelon repairable item systems. OR Spectr. 27(2-3): 369-398 (2005) - [c1]Adriana Felicia Bumb, Jan-Kees C. W. van Ommeren:
An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands. AAIM 2005: 330-339 - 2002
- [j4]Marnix J. J. Garvels, Jan-Kees C. W. van Ommeren, Dirk P. Kroese:
On the importance function in splitting simulation. Eur. Trans. Telecommun. 13(4): 363-371 (2002) - 2001
- [j3]Pieter-Tjerk de Boer, Victor F. Nicola, Jan-Kees C. W. van Ommeren:
The Remaining Service Time upon Reaching a High Level in M/G/1 Queues. Queueing Syst. Theory Appl. 39(1): 55-78 (2001)
1990 – 1999
- 1991
- [j2]Jan-Kees C. W. van Ommeren:
The Discrete-Time Single-Server Queue. Queueing Syst. Theory Appl. 8(3): 279-294 (1991) - 1990
- [j1]Jan-Kees C. W. van Ommeren:
Simple Approximations for the Batch-Arrival Mx/G/1 Queue. Oper. Res. 38(4): 678-685 (1990)
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-04-24 23:15 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:
