default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Resing
Person information
- affiliation: Eindhoven University of Technology, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Yaron Yeger
, Onno J. Boxma, Jacques Resing, Maria Vlasiou:
ASIP tandem queues with consumption. Perform. Evaluation 163: 102380 (2024)- [j30]Tim Engels, Ivo Adan, Onno J. Boxma, Jacques Resing:
An exact analysis and comparison of manual picker routing heuristics. Queueing Syst. Theory Appl. 108(3): 611-660 (2024) - [j29]Yaron Yeger, Onno J. Boxma, Jacques Resing, Maria Vlasiou:
ASIP tandem queues with consumption. SIGMETRICS Perform. Evaluation Rev. 51(4): 14-15 (2024) - [i3]Rowel Gündlach, Ivo V. Stoepker, Stella Kapodistria, Jacques A. C. Resing:
A Holistic Approach for Bitcoin Confirmation Times & Optimal Fee Selection. CoRR abs/2402.17474 (2024) - 2023
- [j28]Tim Engels, Ivo Adan, Onno J. Boxma, Jacques Resing:
Exact results for the order picking time distribution under return routing. Oper. Res. Lett. 51(2): 179-186 (2023) - 2022
- [j27]Rudesindo Núñez-Queija, Balakrishna J. Prabhu, Jacques Resing:
Queueing models with service speed adaptations at arrival instants of an external observer. Queueing Syst. Theory Appl. 100(3-4): 233-235 (2022) - [j26]Ivo Adan, Onno J. Boxma, Jacques Resing:
Functional equations with multiple recursive terms. Queueing Syst. Theory Appl. 102(1-2): 7-23 (2022) - [i2]R. Núñez Queija, Balakrishna J. Prabhu, J. A. C. Resing:
Markovian queues with Poisson control. CoRR abs/2208.10198 (2022) - 2021
- [j25]Rowel Gündlach, Martijn Gijsbers, David T. Koops, Jacques Resing:
Predicting confirmation times of Bitcoin transactions. SIGMETRICS Perform. Evaluation Rev. 48(4): 16-19 (2021) - 2020
- [j24]Jelmer P. van der Gaast, René de Koster, Ivo J. B. F. Adan, J. A. C. Resing:
Capacity Analysis of Sequential Zone Picking Systems. Oper. Res. 68(1): 161-179 (2020) - [j23]Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing:
Revenue maximization in optical router nodes. Perform. Evaluation 140-141: 102108 (2020)
2010 – 2019
- 2019
- [j22]Collin Drent, Stella Kapodistria, J. A. C. Resing:
Condition-based maintenance policies under imperfect maintenance at scheduled and unscheduled opportunities. Queueing Syst. Theory Appl. 93(3-4): 269-308 (2019) - [c9]Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing:
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. VALUETOOLS 2019: 47-53 - 2018
- [i1]Murtuza Ali Abidini, Onno J. Boxma, Cor A. J. Hurkens, Ton Koonen, Jacques Resing:
Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. CoRR abs/1809.07860 (2018) - 2017
- [j21]Murtuza Ali Abidini, Onno J. Boxma, Bara Kim, Jeongsim Kim, Jacques Resing:
Performance analysis of polling systems with retrials and glue periods. Queueing Syst. Theory Appl. 87(3-4): 293-324 (2017) - 2016
- [j20]Murtuza Ali Abidini, Onno J. Boxma, Jacques Resing:
Analysis and optimization of vacation and polling models with retrials. Perform. Evaluation 98: 52-69 (2016) - [j19]E. S. Badila, J. A. C. Resing:
A coupled processor model with simultaneous arrivals and ordered service requirements. Queueing Syst. Theory Appl. 82(1-2): 29-42 (2016) - [c8]Murtuza Ali Abidini, Onno J. Boxma, Ton Koonen, Jacques Resing:
Revenue maximization in an optical router node - allocation of service windows. ONDM 2016: 1-6 - 2014
- [c7]Onno J. Boxma, Jacques Resing:
Vacation and Polling Models with Retrials. EPEW 2014: 45-58 - 2012
- [j18]Stefano Di Lucente, Nicola Calabretta, Jacques Resing, Harm J. S. Dorren:
Scaling Low-Latency Optical Packet Switches to a Thousand Ports. JOCN 4(9): A17-A28 (2012) - 2011
- [c6]Paul Beekhuizen, Jacques Resing:
A saturated tree network of polling stations with flow control. ITC 2011: 294-301 - 2010
- [j17]Jesus R. Artalejo, J. A. C. Resing:
Mean Value Analysis of Single Server retrial Queues. Asia Pac. J. Oper. Res. 27(3): 335-345 (2010)
2000 – 2009
- 2009
- [j16]Paul Beekhuizen, Jacques Resing:
Performance analysis of small non-uniform packet switches. Perform. Evaluation 66(11): 640-659 (2009) - [c5]Paul Beekhuizen, J. A. C. Resing:
Approximation of discrete-time polling systems via structured Markov chains. VALUETOOLS 2009: 16 - [e1]Rudesindo Núñez-Queija, Jacques Resing:
Network Control and Optimization, Third Euro-NF Conference, NET-COOP 2009, Eindhoven, The Netherlands, November 23-25, 2009, Proceedings. Lecture Notes in Computer Science 5894, Springer 2009, ISBN 978-3-642-10405-3 [contents] - 2008
- [j15]Paul Beekhuizen, Dee Denteneer, Jacques Resing:
Reduction of a polling network to a single node. Queueing Syst. Theory Appl. 58(4): 303-319 (2008) - [c4]Paul Beekhuizen, T. J. J. Denteneer, J. A. C. Resing:
End-to-end delays in polling tree networks. VALUETOOLS 2008: 42 - 2007
- [c3]Lasse Leskelä, Jacques Resing:
A Tandem Queueing Network with Feedback Admission Control. NET-COOP 2007: 129-137 - [c2]Robert D. van der Mei, Jacques Resing:
Polling Models with Two-Stage Gated Service: Fairness Versus Efficiency. ITC 2007: 544-555 - 2006
- [j14]Johan van Leeuwaarden, Dee Denteneer, Jacques Resing:
A discrete-time queueing model with periodically scheduled arrival and departure slots. Perform. Evaluation 63(4-5): 278-294 (2006) - 2005
- [j13]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) - [j12]J. S. H. van Leeuwaarden, Jacques Resing:
A Tandem Queue with Coupled Processors: Computational Issues. Queueing Syst. Theory Appl. 51(1-2): 29-52 (2005) - 2004
- [j11]Ronald Rietman, Jacques Resing:
An M/G/1 Queueing Model with Gated Random Order of Service. Queueing Syst. Theory Appl. 48(1-2): 89-102 (2004) - 2003
- [j10]Jacques Resing, E. Lerzan Örmeci:
A tandem queueing model with coupled processors. Oper. Res. Lett. 31(3): 383-389 (2003) - [j9]Onno J. Boxma, Dee Denteneer, Jacques Resing:
Delay models for contention trees in closed populations. Perform. Evaluation 53(3-4): 169-185 (2003) - 2002
- [c1]Onno J. Boxma, Dee Denteneer, Jacques Resing:
Some Models for Contention Resolution in Cable Networks. NETWORKING 2002: 117-128 - 2001
- [j8]Ivo J. B. F. Adan, Onno J. Boxma, Jacques Resing:
Queueing Models with Multiple Waiting Lines. Queueing Syst. Theory Appl. 37(1/3): 65-98 (2001) - 2000
- [j7]Ivo J. B. F. Adan, Jacques Resing:
A two-level traffic shaper for an on-off source. Perform. Evaluation 42(4): 279-298 (2000)
1990 – 1999
- 1999
- [j6]Ivo J. B. F. Adan, Ton de Kok, Jacques Resing:
A multi-server queueing model with locking. Eur. J. Oper. Res. 116(2): 249-258 (1999) - 1998
- [j5]Ivo J. B. F. Adan, Erik A. van Doorn, Jacques Resing, Werner R. W. Scheinhardt:
Analysis of a single-server queue interacting with a fluid reservoir. Queueing Syst. Theory Appl. 29(2-4): 313-336 (1998) - 1996
- [j4]Ivo J. B. F. Adan, Jacques Resing:
Simple Analysis of a Fluid Queue Driven by an M/M/1 Queue. Queueing Syst. Theory Appl. 22(1-2): 171-174 (1996) - 1994
- [j3]Onno J. Boxma, J. A. C. Resing:
Tandem queues with deterministic service times. Ann. Oper. Res. 49(1): 221-239 (1994) - [j2]J. G. Braker, J. A. C. Resing:
Periodicity and critical circuits in a generalized max-algebra setting. Discret. Event Dyn. Syst. 4(3): 293-314 (1994) - 1993
- [j1]Jacques Resing:
Polling systems and multitype branching processes. Queueing Syst. Theory Appl. 13(4): 409-426 (1993)
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-10-31 20:13 CET 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:
