Research Output per year
Fingerprint Dive into the research topics where Jan C.W. van Ommeren is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 3 Similar Profiles
Queueing System
Mathematics
Queue
Mathematics
Queue Length
Mathematics
Traffic
Mathematics
Wireless sensor networks
Engineering & Materials Science
Contour integral
Mathematics
Intersection
Mathematics
Batch Service
Mathematics
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Research Output 1990 2019
An exact root-free method for the expected queue length for a class of discrete-time queueing systems
Oblakova, A., Al Hanbali, A., Boucherie, R., van Ommeren, J. C. W. & Zijm, H., 1 Aug 2019, In : Queueing systems. 92, 3-4, p. 257-292 36 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Expected Length
Queue Length
Queueing System
Discrete-time Systems
Telecommunication traffic
Queueing models for urban traffic networks
Oblakova, A., 27 Sep 2019, Enschede: University of Twente. 208 p.Research output: Thesis › PhD Thesis - Research UT, graduation UT › Academic
Open Access
File
Telecommunication traffic
Traffic control
Traffic congestion
Roots, symmetry and contour integrals in queueing systems
Oblakova, A., Al Hanbali, A., Boucherie, R., van Ommeren, J. C. W. & Zijm, W. H. M., May 2019, University of Twente, Department of Applied Mathematics. 23 p. (TW-memoranda; no. 2067)Research output: Book/Report › Report › Other research output
File
Contour integral
Queueing System
Probability generating function
Roots
Symmetry
Threshold Queueing to Describe the Fundamental Diagram of Uninterrupted Traffic
Baër, N., Boucherie, R. J. & van Ommeren, J-K. C. W., 26 Mar 2019, In : Transportation science. 53, 2, p. 585-596 12 p.Research output: Contribution to journal › Article › Academic › peer-review
traffic
road traffic
An average case analysis of the minimum spanning tree heuristic for the power assignment problem
de Graaf, M., Boucherie, R., Hurink, J. L. & van Ommeren, J. C. W., 6 Dec 2018, In : Random Structures and Algorithms. p. 1-15 15 p., RSA20831.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Average-case Analysis
Minimum Spanning Tree
Assignment Problem
Random variables
Heuristics
Activities 1994 2005
- 3 Oral presentation
An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands
Jan C.W. van Ommeren (Speaker)24 Jun 2005
Activity: Talk or presentation › Oral presentation
Loss probabilities in batch-arrival bulk-service queues with finite capacity
Jan C.W. van Ommeren (Invited speaker)14 Jul 1997
Activity: Talk or presentation › Oral presentation
Transient analysis of the batch arrival M/M/1/N queue
Jan C.W. van Ommeren (Speaker)21 Jun 1994
Activity: Talk or presentation › Oral presentation