default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan-Pieter L. Dorsman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Jan-Pieter L. Dorsman
, Kristen Gardner:
New directions in pass-and-swap queues. Queueing Syst. Theory Appl. 107(3-4): 205-256 (2024)- 2022
- [j15]Urtzi Ayesta, Tejas Bodas, Jan-Pieter L. Dorsman, Ina Maria Verloop:
A Token-Based Central Queue with Order-Independent Service Rates. Oper. Res. 70(1): 545-561 (2022) - [i4]Céline Comte, Jan-Pieter L. Dorsman:
Performance Evaluation of Stochastic Bipartite Matching Models. CoRR abs/2201.03982 (2022) - 2021
- [j14]L. R. van Kreveld, Onno J. Boxma, Jan-Pieter L. Dorsman, M. R. H. Mandjes:
Scaling limits for closed product-form queueing networks. Perform. Evaluation 151: 102220 (2021) - [j13]Céline Comte, Jan-Pieter L. Dorsman:
Pass-and-swap queues. Queueing Syst. Theory Appl. 98(3-4): 275-331 (2021) - [c7]Céline Comte, Jan-Pieter L. Dorsman:
Performance Evaluation of Stochastic Bipartite Matching Models. EPEW 2021: 425-440 - 2020
- [j12]Ziv Scully, Lucas van Kreveld, Onno J. Boxma, Jan-Pieter L. Dorsman, Adam Wierman:
Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes. Proc. ACM Meas. Anal. Comput. Syst. 4(2): 30:1-30:33 (2020) - [c6]Ziv Scully, Lucas van Kreveld, Onno J. Boxma, Jan-Pieter L. Dorsman, Adam Wierman:
Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes. SIGMETRICS (Abstracts) 2020: 35-36 - [c5]L. R. van Kreveld, Onno J. Boxma, Jan-Pieter L. Dorsman, M. R. H. Mandjes:
Scaling analysis of an extended machine-repair model. VALUETOOLS 2020: 172-179 - [i3]Céline Comte, Jan-Pieter L. Dorsman:
Pass-and-swap queues. CoRR abs/2009.12299 (2020)
2010 – 2019
- 2019
- [c4]Han Zhou, Jan-Pieter L. Dorsman, Maaike Snelder, Erik de Romph, Michel Mandjes:
GPU-based Parallel Computing for Activity-based Travel Demand Models. ANT/EDI40 2019: 726-732 - [i2]Urtzi Ayesta, Tejas Bodas, Jan-Pieter L. Dorsman, Maaike Verloop:
A token-based central queue with order-independent service rates. CoRR abs/1902.02137 (2019) - 2018
- [c3]Benjamin Berg, Jan-Pieter L. Dorsman, Mor Harchol-Balter:
Towards Optimality in Parallel Job Scheduling. SIGMETRICS (Abstracts) 2018: 116-118 - 2017
- [j11]Benjamin Berg, Jan-Pieter L. Dorsman, Mor Harchol-Balter:
Towards Optimality in Parallel Scheduling. Proc. ACM Meas. Anal. Comput. Syst. 1(2): 40:1-40:30 (2017) - [i1]Benjamin Berg, Jan-Pieter L. Dorsman, Mor Harchol-Balter:
Towards Optimality in Parallel Scheduling. CoRR abs/1707.07097 (2017) - 2016
- [j10]Dieter Fiems, Jan-Pieter L. Dorsman, Wouter Rogiest:
Analysing queueing behaviour in void-avoiding fibre-loop optical buffers. Perform. Evaluation 103: 23-40 (2016) - 2015
- [j9]Jan-Pieter L. Dorsman, Sem C. Borst, Onno J. Boxma, Maria Vlasiou:
Markovian polling systems with an application to wireless random-access networks. Perform. Evaluation 85-86: 33-51 (2015) - [j8]René Bekker, Petra Vis, Jan-Pieter L. Dorsman, Robert D. van der Mei, Erik M. M. Winands:
The impact of scheduling policies on the waiting-time distributions in polling systems. Queueing Syst. Theory Appl. 79(2): 145-172 (2015) - [j7]Jan-Pieter L. Dorsman, Maria Vlasiou, Bert Zwart:
Heavy-traffic asymptotics for networks of parallel queues with Markov-modulated service speeds. Queueing Syst. Theory Appl. 79(3-4): 293-319 (2015) - 2014
- [j6]Jan-Pieter L. Dorsman, Onno J. Boxma, Robert D. van der Mei:
On two-queue Markovian polling systems with exhaustive service. Queueing Syst. Theory Appl. 78(4): 287-311 (2014) - [c2]Wouter Rogiest, Jan-Pieter L. Dorsman, Dieter Fiems:
Analysis of fibre-loop optical buffers with a void-avoiding schedule. VALUETOOLS 2014 - 2013
- [j5]Jan-Pieter L. Dorsman, Robert D. van der Mei, Maria Vlasiou:
Analysis of a two-layered network by means of the power-series algorithm. Perform. Evaluation 70(12): 1072-1089 (2013) - [j4]Jan-Pieter L. Dorsman, Onno J. Boxma, Maria Vlasiou:
Marginal queue length approximations for a two-layered network with correlated queues. Queueing Syst. Theory Appl. 75(1): 29-63 (2013) - [j3]René Bekker, Jan-Pieter L. Dorsman, Robert D. van der Mei, Petra Vis, Erik M. M. Winands:
Scheduling in polling systems in heavy traffic. SIGMETRICS Perform. Evaluation Rev. 41(2): 41-43 (2013) - [j2]Jan-Pieter L. Dorsman, Maria Vlasiou, Bert Zwart:
Parallel queueing networks with Markov-modulated service speeds in heavy traffic. SIGMETRICS Perform. Evaluation Rev. 41(2): 47-49 (2013) - [c1]Nir Perel, Jan-Pieter L. Dorsman, Maria Vlasiou:
Cyclic-type Polling Models with Preparation Times. ICORES 2013: 14-23 - 2012
- [j1]Jan-Pieter L. Dorsman, Robert D. van der Mei, Erik M. M. Winands:
Polling systems with batch service. OR Spectr. 34(3): 743-761 (2012)
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-09-10 02:05 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:
