Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarko A. A. Boon
Person information
- affiliation: Eindhoven University of Technology, Department of Mathematics and Computer Science, Eindhoven, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Roshan Mahes
, Michel Mandjes, Marko Boon:
Adaptive appointment scheduling with periodic updates. Comput. Oper. Res. 161: 106437 (2024)- [j24]Roshan Mahes, Michel Mandjes, Marko Boon, Peter G. Taylor:
Adaptive scheduling in service systems: A Dynamic programming approach. Eur. J. Oper. Res. 312(2): 605-626 (2024) - 2023
- [j23]Nikki Levering, Marko Boon, Michel Mandjes:
Estimating Probability Distributions of Travel Times by Fitting a Markovian Velocity Model. IEEE Trans. Intell. Transp. Syst. 24(11): 12372-12392 (2023) - [i15]P. C. Joshi, Marko A. A. Boon, Sem C. Borst:
Trajectories and Platoon-forming Algorithm for Intersections with Heterogeneous Autonomous Traffic. CoRR abs/2311.07435 (2023) - 2022
- [j22]Marko Boon, Onno J. Boxma, Sergey Foss:
Editorial introduction to '100 views on queues'. Queueing Syst. Theory Appl. 100(3-4): 167-168 (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) - 2020
- [j20]K. J. C. Fransen, J. A. W. M. van Eekelen, Alexander Yu. Pogromsky, Marko A. A. Boon, Ivo J. B. F. Adan:
A dynamic path planning approach for dense, large, grid-based automated guided vehicle systems. Comput. Oper. Res. 123: 105046 (2020) - [c4]Rik W. Timmerman, Marko A. A. Boon:
New vehicle-actuated access algorithms for intersections close to oversaturation. ITSC 2020: 1-6 - [i14]Debarati Bhaumik, Marko A. A. Boon, Daan Crommelin, Barry Koren, Bert Zwart:
Computing first passage times for Markov-modulated fluid models using numerical PDE problem solvers. CoRR abs/2003.14300 (2020)
2010 – 2019
- 2019
- [j19]Ivo J. B. F. Adan, Marko A. A. Boon, Gideon Weiss:
Design heuristic for parallel many server systems. Eur. J. Oper. Res. 273(1): 259-277 (2019) - [j18]Abhishek, Marko A. A. Boon, Michel Mandjes, Rudesindo Núñez-Queija:
Congestion analysis of unsignalized intersections: The impact of impatience and Markov platooning. Eur. J. Oper. Res. 273(3): 1026-1035 (2019) - [j17]Abhishek, Marko A. A. Boon, Michel Mandjes:
Generalized gap acceptance models for unsignalized intersections. Math. Methods Oper. Res. 89(3): 385-409 (2019) - [j16]Thomas M. M. Meyfroyt, Marko A. A. Boon, Sem C. Borst, Onno J. Boxma:
Performance of large-scale polling systems with branching-type and limited service. Perform. Evaluation 133: 1-24 (2019) - [j15]Marko A. A. Boon, A. J. E. M. Janssen, J. S. H. van Leeuwaarden, R. W. Timmerman:
Pollaczek contour integrals for the fixed-cycle traffic-light queue. Queueing Syst. Theory Appl. 91(1-2): 89-111 (2019) - [c3]Bo Klaasse, Rik Timmerman, Tessel van Ballegooijen, Marko A. A. Boon, Gerard Eijkelenboom:
A Novel Data-Driven Algorithm for the Automated Detection of Unexpectedly High Traffic Flow in Uncongested Traffic States. EPEW 2019: 65-83 - [i13]R. W. Timmerman, Marko A. A. Boon:
Platoon Forming Algorithms for Intelligent Street Intersections. CoRR abs/1901.04583 (2019) - 2017
- [j14]Abhishek, Marko A. A. Boon, Onno J. Boxma, Rudesindo Núñez-Queija:
A single-server queue with batch arrivals and semi-Markov services. Queueing Syst. Theory Appl. 86(3-4): 217-240 (2017) - [j13]Marko A. A. Boon, Onno J. Boxma, Offer Kella, Masakiyo Miyazawa:
Queue-length balance equations in multiclass multiserver queues and their generalizations. Queueing Syst. Theory Appl. 86(3-4): 277-299 (2017) - 2016
- [j12]Marko A. A. Boon, Erik M. M. Winands:
Critically loaded k-limited polling systems. EAI Endorsed Trans. Collab. Comput. 2(10): e1 (2016) - [c2]Abhishek, Michel Mandjes, Marko A. A. Boon, Rudesindo Núñez-Queija:
Congestion analysis of unsignalized intersections. COMSNETS 2016: 1-6 - [i12]Ivo J. B. F. Adan, Marko A. A. Boon, Gideon Weiss:
Design Heuristic for Parallel Many Server Systems under FCFS-ALIS. CoRR abs/1603.01404 (2016) - 2015
- [i11]Marko A. A. Boon, Erik M. M. Winands:
Critically loaded k-limited polling systems with switch-over times. CoRR abs/1505.04996 (2015) - 2014
- [i10]Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma:
A Two-Queue Polling Model with Two Priority Levels in the First Queue. CoRR abs/1408.0110 (2014) - [i9]Marko A. A. Boon, Ivo J. B. F. Adan:
Mixed Gated/Exhaustive Service in a Polling Model with Priorities. CoRR abs/1408.0124 (2014) - [i8]Marko A. A. Boon:
A Polling Model with Reneging at Polling Instants. CoRR abs/1408.0131 (2014) - [i7]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) - [i6]Marko A. A. Boon, Rob van der Mei, Erik M. M. Winands:
Applications of polling systems. CoRR abs/1408.0136 (2014) - [i5]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) - [i4]Marko A. A. Boon, Onno J. Boxma, Erik M. M. Winands:
On open problems in polling systems. CoRR abs/1408.0142 (2014) - [i3]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) - [i2]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) - [i1]Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma:
A Polling Model with Multiple Priority Levels. CoRR abs/1408.0282 (2014) - 2013
- [j11]Ivo J. B. F. Adan, Marko A. A. Boon, Gideon Weiss:
Design and evaluation of overloaded service systems with skill based routing, under FCFS policies. Perform. Evaluation 70(10): 873-888 (2013) - [j10]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) - [j9]Ivo J. B. F. Adan, Marko A. A. Boon, Ana Busic, Jean Mairesse, Gideon Weiss:
Queues with skill based parallel servers and a FCFS infinite matching model. SIGMETRICS Perform. Evaluation Rev. 41(3): 22-24 (2013) - 2012
- [j8]Marko A. A. Boon:
A polling model with reneging at polling instants. Ann. Oper. Res. 198(1): 5-23 (2012) - 2011
- [j7]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) - [j6]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) - [j5]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) - 2010
- [j4]Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma:
A Two-Queue Polling Model with Two Priority Levels in the First Queue. Discret. Event Dyn. Syst. 20(4): 511-536 (2010) - [j3]Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma:
A polling model with multiple priority levels. Perform. Evaluation 67(6): 468-484 (2010) - [j2]Marko A. A. Boon, A. C. C. van Wijk, Ivo J. B. F. Adan, Onno J. Boxma:
A polling model with smart customers. Queueing Syst. Theory Appl. 66(3): 239-274 (2010)
2000 – 2009
- 2009
- [j1]Marko A. A. Boon, Ivo J. B. F. Adan:
Mixed gated/exhaustive service in a polling model with priorities. Queueing Syst. Theory Appl. 63(1-4): 383-399 (2009) - 2008
- [c1]Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma:
A two-queue polling model with two priority levels in the first queue. VALUETOOLS 2008: 43
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-21 17:07 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:
