default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik M. M. Winands
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Marko A. A. Boon
, Erik M. M. Winands:
Open problems for critically loaded k-limited polling systems. Queueing Syst. Theory Appl. 100(3-4): 281-283 (2022)
2010 – 2019
- 2016
- [j20]Marko A. A. Boon, Erik M. M. Winands:
Critically loaded k-limited polling systems. EAI Endorsed Trans. Collab. Comput. 2(10): e1 (2016) - 2015
- [j19]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) - [i7]Marko A. A. Boon, Erik M. M. Winands:
Critically loaded k-limited polling systems with switch-over times. CoRR abs/1505.04996 (2015) - 2014
- [i6]Marko A. A. Boon, Erik M. M. Winands, Ivo J. B. F. Adan, A. C. C. van Wijk:
Closed-Form Waiting Time Approximations for Polling Systems. CoRR abs/1408.0134 (2014) - [i5]Marko A. A. Boon, Rob van der Mei, Erik M. M. Winands:
Applications of polling systems. CoRR abs/1408.0136 (2014) - [i4]Marko A. A. Boon, Ivo J. B. F. Adan, Erik M. M. Winands, Douglas G. Down:
Delays at signalised intersections with exhaustive traffic control. CoRR abs/1408.0137 (2014) - [i3]Marko A. A. Boon, Onno J. Boxma, Erik M. M. Winands:
On open problems in polling systems. CoRR abs/1408.0142 (2014) - [i2]Marko A. A. Boon, Rob van der Mei, Erik M. M. Winands:
Waiting times in queueing networks with a single shared server. CoRR abs/1408.0146 (2014) - [i1]Marko A. A. Boon, Rob van der Mei, Erik M. M. Winands:
Queueing networks with a single shared server: light and heavy traffic. CoRR abs/1408.0151 (2014) - 2013
- [j18]Marko A. A. Boon, Robert D. van der Mei, Erik M. M. Winands:
Waiting times in queueing networks with a single shared server. Queueing Syst. Theory Appl. 74(4): 403-429 (2013) - [j17]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) - 2012
- [j16]Ivo J. B. F. Adan, Erik M. M. Winands:
Editorial polling systems. Ann. Oper. Res. 198(1): 1-3 (2012) - [j15]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) - 2011
- [j14]Erik M. M. Winands, Ivo J. B. F. Adan, Geert-Jan van Houtum:
The stochastic economic lot scheduling problem: A survey. Eur. J. Oper. Res. 210(1): 1-9 (2011) - [j13]Erik M. M. Winands:
Branching-type polling systems with large setups. OR Spectr. 33(1): 77-97 (2011) - [j12]Marko A. A. Boon, Erik M. M. Winands, Ivo J. B. F. Adan, A. C. C. van Wijk:
Closed-form waiting time approximations for polling systems. Perform. Evaluation 68(3): 290-306 (2011) - [j11]Marko A. A. Boon, Onno J. Boxma, Erik M. M. Winands:
On open problems in polling systems. Queueing Syst. Theory Appl. 68(3-4): 365-374 (2011) - [j10]Marko A. A. Boon, Robert D. van der Mei, Erik M. M. Winands:
Queueing networks with a single shared server: light and heavy traffic. SIGMETRICS Perform. Evaluation Rev. 39(2): 44-46 (2011)
2000 – 2009
- 2008
- [j9]Robert D. van der Mei, Erik M. M. Winands:
A note on polling models with renewal arrivals and nonzero switch-over times. Oper. Res. Lett. 36(4): 500-505 (2008) - [j8]Robert D. van der Mei, Erik M. M. Winands:
Heavy traffic analysis of polling models by mean value analysis. Perform. Evaluation 65(6-7): 400-416 (2008) - 2007
- [j7]Erik M. M. Winands:
On polling systems with large setups. Oper. Res. Lett. 35(5): 584-590 (2007) - [j6]Adam Wierman, Erik M. M. Winands, Onno J. Boxma:
Scheduling in polling systems. Perform. Evaluation 64(9-12): 1009-1028 (2007) - [j5]Robert D. van der Mei, Erik M. M. Winands:
Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics. Perform. Evaluation 64(9-12): 1029-1040 (2007) - [j4]Marcel van Vuuren, Erik M. M. Winands:
Iterative approximation of k -limited polling systems. Queueing Syst. Theory Appl. 55(3): 161-178 (2007) - 2006
- [j3]Ivo J. B. F. Adan, J. S. H. van Leeuwaarden, Erik M. M. Winands:
On the application of Rouché's theorem in queueing theory. Oper. Res. Lett. 34(3): 355-360 (2006) - [j2]Erik M. M. Winands, Ivo J. B. F. Adan, Geert-Jan van Houtum:
Mean value analysis for polling systems. Queueing Syst. Theory Appl. 54(1): 35-44 (2006) - [c1]Robert D. van der Mei, Erik M. M. Winands:
Mean value analysis for polling systems in heavy traffic. VALUETOOLS 2006: 47 - 2005
- [j1]Erik M. M. Winands, T. J. J. Denteneer, J. A. C. Resing, Ronald Rietman:
A finite-source queuing model for the IEEE 802.11 DCF. Eur. Trans. Telecommun. 16(1): 77-89 (2005)
Coauthor Index
aka: Rob van der Mei
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:09 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:
