default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOnno J. Boxma
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
showing all ?? records
2020 – today
- 2024
[j145]Onno J. Boxma, David Perry, Wolfgang Stadje:
Perishable inventories with random input: a unifying survey with extensions. Ann. Oper. Res. 332(1): 1069-1105 (2024)- [j144]Onno J. Boxma:
The number of overlapping customers. Oper. Res. Lett. 57: 107203 (2024) - [j143]Yaron Yeger
, Onno J. Boxma, Jacques Resing, Maria Vlasiou:
ASIP tandem queues with consumption. Perform. Evaluation 163: 102380 (2024) - [j142]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) - [j141]Yaron Yeger, Onno J. Boxma, Jacques Resing, Maria Vlasiou:
ASIP tandem queues with consumption. SIGMETRICS Perform. Evaluation Rev. 51(4): 14-15 (2024) - 2023
- [j140]Onno J. Boxma, David Perry, Wolfgang Stadje:
Stationary analysis of an (R, Q) inventory model with normal and emergency orders. J. Appl. Probab. 60(1): 106-126 (2023) - [j139]Onno J. Boxma, Michel Mandjes:
A decomposition for Lévy processes inspected at Poisson moments. J. Appl. Probab. 60(2): 557-569 (2023) - [j138]Stella Kapodistria, Mayank Saxena, Onno J. Boxma, Offer Kella:
Workload analysis of a two-queue fluid polling model. J. Appl. Probab. 60(3): 1003-1030 (2023) - [j137]Nitzan Carmeli, Galit B. Yom-Tov, Onno J. Boxma:
State-Dependent Estimation of Delay Distributions in Fork-Join Networks. Manuf. Serv. Oper. Manag. 25(3): 1081-1098 (2023) - [j136]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) - [j135]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Fork-join and redundancy systems with heavy-tailed job sizes. Queueing Syst. Theory Appl. 103(1-2): 131-159 (2023) - [j134]Royi Jacobovic, Nikki Levering, Onno J. Boxma:
Externalities in the M/G/1 queue: LCFS-PR versus FCFS. Queueing Syst. Theory Appl. 104(3-4): 239-267 (2023) - 2022
- [j133]Onno J. Boxma, David Perry, Wolfgang Stadje, Shelley Zacks:
A compound Poisson EOQ model for perishable items with intermittent high and low demand periods. Ann. Oper. Res. 317(2): 439-459 (2022) - [j132]Onno J. Boxma, David Perry, Wolfgang Stadje:
Peer-to-Peer Lending: a Growth-Collapse Model and its Steady-State Analysis. Math. Methods Oper. Res. 96(2): 233-258 (2022) - [j131]Marko Boon, Onno J. Boxma, Sergey Foss:
Editorial introduction to '100 views on queues'. Queueing Syst. Theory Appl. 100(3-4): 167-168 (2022) - [j130]Ivo Adan, Onno J. Boxma, Jacques Resing:
Functional equations with multiple recursive terms. Queueing Syst. Theory Appl. 102(1-2): 7-23 (2022) - [j129]Onno J. Boxma, M. R. H. Mandjes:
Queueing and risk models with dependencies. Queueing Syst. Theory Appl. 102(1-2): 69-86 (2022) - 2021
- [j128]Onno J. Boxma, Michel Mandjes:
Affine Storage and Insurance Risk Models. Math. Oper. Res. 46(4): 1282-1302 (2021) - [j127]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Stability and tail behavior of redundancy systems with processor sharing. Perform. Evaluation 147: 102195 (2021) - [j126]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) - [j125]Onno J. Boxma, Offer Kella, Uri Yechiali:
Workload distributions in ASIP queueing networks. Queueing Syst. Theory Appl. 97(1-2): 81-100 (2021) - [j124]Onno J. Boxma, Andreas Löpker, Michel Mandjes, Zbigniew Palmowski:
A multiplicative version of the Lindley recursion. Queueing Syst. Theory Appl. 98(3-4): 225-245 (2021) - [j123]Yutaka Sakuma, Onno J. Boxma, Tuan Phung-Duc:
An M/PH/1 queue with workload-dependent processing speed and vacations. Queueing Syst. Theory Appl. 98(3-4): 373-405 (2021) - [j122]Onno J. Boxma, Michel Mandjes:
Shot-noise queueing models. Queueing Syst. Theory Appl. 99(1-2): 121-159 (2021) - [c30]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Threshold-based rerouting and replication for resolving job-server affinity relations. INFOCOM 2021: 1-10 - [i10]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Fork-join and redundancy systems with heavy-tailed job sizes. CoRR abs/2105.13738 (2021) - 2020
- [j121]Onno J. Boxma, Andreas Löpker, Michel Mandjes:
On two classes of reflected autoregressive processes. J. Appl. Probab. 57(2): 657-678 (2020) - [j120]Offer Kella, Onno J. Boxma:
Synchronized Lévy queues. J. Appl. Probab. 57(4): 1222-1233 (2020) - [j119]Collin Drent, Stella Kapodistria, Onno J. Boxma:
Censored lifetime learning: Optimal Bayesian age-replacement policies. Oper. Res. Lett. 48(6): 827-834 (2020) - [j118]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) - [j117]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) - [c29]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 - [c28]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Stability of Redundancy Systems with Processor Sharing. VALUETOOLS 2020: 120-127 - [c27]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 - [i9]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Threshold-based rerouting and replication for resolving job-server affinity relations. CoRR abs/2005.13353 (2020)
2010 – 2019
- 2019
- [j116]Onno J. Boxma, David Perry, Wolfgang Stadje:
The (S-1, S) inventory model and its counterparts in queueing theory. Oper. Res. Lett. 47(6): 483-488 (2019) - [j115]Onno J. Boxma, Offer Kella, Liron Ravner:
Fluid queues with synchronized output. Oper. Res. Lett. 47(6): 629-635 (2019) - [j114]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) - [j113]Onno J. Boxma, Offer Kella, Michel Mandjes:
Infinite-server systems with Coxian arrivals. Queueing Syst. Theory Appl. 92(3-4): 233-255 (2019) - [j112]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Redundancy scheduling with scaled Bernoulli service requirements. Queueing Syst. Theory Appl. 93(1-2): 67-82 (2019) - [c26]Yutaka Sakuma, Onno J. Boxma, Tuan Phung-Duc:
A Single Server Queue with Workload-Dependent Service Speed and Vacations. QTNA 2019: 112-127 - [c25]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
- [j111]Onno J. Boxma, Bert Zwart:
Fluid flow models in performance analysis. Comput. Commun. 131: 22-25 (2018) - [j110]David T. Koops, Mayank Saxena, Onno J. Boxma, Michel Mandjes:
Infinite-server queues with Hawkes input. J. Appl. Probab. 55(3): 920-943 (2018) - [j109]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Delta probing policies for redundancy. Perform. Evaluation 127-128: 21-35 (2018) - [j108]Yoshiaki Inoue, Onno J. Boxma, David Perry, Shelley Zacks:
Analysis of Mx/G/1 queues with impatient customers. Queueing Syst. Theory Appl. 89(3-4): 303-350 (2018) - [j107]Ivo Adan, Onno J. Boxma, Dieter Claeys, Offer Kella:
A Queueing System with Vacations after a Random Amount of Work. SIAM J. Appl. Math. 78(3): 1697-1711 (2018) - [j106]Youri Raaijmakers, Sem C. Borst, Onno J. Boxma:
Delta probing policies for redundancy. SIGMETRICS Perform. Evaluation Rev. 46(3): 72-73 (2018) - [i8]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
- [j105]Onno J. Boxma, Joris Walraevens:
Computational methods and applications in queueing theory. Ann. Oper. Res. 252(1): 1-2 (2017) - [j104]Shaul K. Bar-Lev, Onno J. Boxma, Igor Kleiner, David Perry, Wolfgang Stadje:
Recycled incomplete identification procedures for blood screening. Eur. J. Oper. Res. 259(1): 330-343 (2017) - [j103]Onno J. Boxma, Esther Frostig, David Perry:
A reinsurance risk model with a threshold coverage policy: the Gerber-Shiu penalty function. J. Appl. Probab. 54(1): 267-285 (2017) - [j102]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) - [j101]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) - [j100]David T. Koops, Onno J. Boxma, M. R. H. Mandjes:
Networks of \(\cdot /G/\infty \) queues with shot-noise-driven arrival intensities. Queueing Syst. Theory Appl. 86(3-4): 301-325 (2017) - [j99]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) - [c24]Murtuza Ali Abidini, Onno J. Boxma, Josu Doncel:
Size-based Routing to Balance Performance of the Queues. VALUETOOLS 2017: 198-205 - 2016
- [j98]Onno J. Boxma, Andreas Löpker, David Perry:
On a make-to-stock production/mountain modeln with hysteretic control. Ann. Oper. Res. 241(1-2): 53-82 (2016) - [j97]Ivo J. B. F. Adan, Onno J. Boxma, Stella Kapodistria, Vidyadhar G. Kulkarni:
The shorter queue polling model. Ann. Oper. Res. 241(1-2): 167-200 (2016) - [j96]Dieter Claeys, Ivo J. B. F. Adan, Onno J. Boxma:
Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations. Eur. J. Oper. Res. 254(3): 895-906 (2016) - [j95]Onno J. Boxma, Michel Mandjes, Josh Reed:
On a class of reflected AR(1) processes. J. Appl. Probab. 53(3): 818-832 (2016) - [j94]Murtuza Ali Abidini, Onno J. Boxma, Jacques Resing:
Analysis and optimization of vacation and polling models with retrials. Perform. Evaluation 98: 52-69 (2016) - [j93]Onno J. Boxma, Shelemyahu Zacks:
Lajos Takács. Queueing Syst. Theory Appl. 82(1-2): 1-4 (2016) - [j92]Onno J. Boxma, Joris Walraevens:
Special volume on 'Methodological Advances in Queueing Theory' of the First ECQT Conference. Queueing Syst. Theory Appl. 82(1-2): 5-6 (2016) - [j91]Onno J. Boxma, Offer Kella, Uri Yechiali:
An ASIP model with general gate opening intervals. Queueing Syst. Theory Appl. 84(1-2): 1-20 (2016) - [j90]David T. Koops, Onno J. Boxma, M. R. H. Mandjes:
A tandem fluid network with Lévy input in heavy traffic. Queueing Syst. Theory Appl. 84(3-4): 355-379 (2016) - [c23]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 - 2015
- [j89]Onno J. Boxma, Mahmut Parlar, David Perry:
A make-to-stock mountain-type inventory model. Ann. Oper. Res. 231(1): 65-77 (2015) - [j88]Onno J. Boxma, David Perry, Shelley Zacks:
A Fluid EOQ Model of Perishable Items with Intermittent High and Low Demand Rates. Math. Oper. Res. 40(2): 390-402 (2015) - [j87]Thomas M. M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer:
A data propagation model for wireless gossiping. Perform. Evaluation 85-86: 19-32 (2015) - [j86]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) - [j85]Thomas M. M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer:
On the scalability and message count of Trickle-based broadcasting schemes. Queueing Syst. Theory Appl. 81(2-3): 203-230 (2015) - [c22]Maialen Larrañaga, Onno J. Boxma, R. Núñez Queija, Mark S. Squillante:
Efficient Content Delivery in the Presence of Impatient Jobs. ITC 2015: 73-81 - [i7]Thomas M. M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer:
On the Scalability and Message Count of Trickle-based Broadcasting Schemes. CoRR abs/1509.08665 (2015) - 2014
- [j84]Hansjörg Albrecher, Onno J. Boxma, Jevgenijs Ivanovs:
On Simple Ruin Expressions in Dependent Sparre Andersen Risk Models. J. Appl. Probab. 51(1): 293-296 (2014) - [j83]Niek Bouman, Sem C. Borst, Onno J. Boxma, J. S. H. van Leeuwaarden:
Queues with random back-offs. Queueing Syst. Theory Appl. 77(1): 33-74 (2014) - [j82]Onno J. Boxma, Offer Kella:
Decomposition results for stochastic storage processes and queues with alternating Lévy inputs. Queueing Syst. Theory Appl. 77(1): 97-112 (2014) - [j81]Onno J. Boxma, Hans Daduna:
The cyclic queue and the tandem queue. Queueing Syst. Theory Appl. 77(3): 275-295 (2014) - [j80]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) - [c21]Onno J. Boxma, Jacques Resing:
Vacation and Polling Models with Retrials. EPEW 2014: 45-58 - [c20]Thomas M. M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer:
Data dissemination performance in large-scale sensor networks. SIGMETRICS 2014: 395-406 - [i6]Thomas M. M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer:
Data Dissemination Performance in Large-Scale Sensor Networks. CoRR abs/1407.6034 (2014) - [i5]Thomas M. M. Meyfroyt, Sem C. Borst, Onno J. Boxma, Dee Denteneer:
A Data Propagation Model for Wireless Gossiping. CoRR abs/1407.6396 (2014) - [i4]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) - [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, Ivo J. B. F. Adan, Onno J. Boxma:
A Polling Model with Multiple Priority Levels. CoRR abs/1408.0282 (2014) - 2013
- [j79]Offer Kella, Onno J. Boxma:
Useful Martingales for Stochastic Storage Processes with Lévy-Type Input. J. Appl. Probab. 50(2): 439-449 (2013) - [j78]Brian H. Fralix, Johan S. H. van Leeuwaarden, Onno J. Boxma:
Factorization Identities for Reflected Processes, with Applications. J. Appl. Probab. 50(3): 632-653 (2013) - [j77]R. Ravid, Onno J. Boxma, David Perry:
Repair systems with exchangeable items and the longest queue mechanism. Queueing Syst. Theory Appl. 73(3): 295-316 (2013) - [j76]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) - [i1]Susanne Albers, Onno J. Boxma, Kirk Pruhs:
Scheduling (Dagstuhl Seminar 13111). Dagstuhl Reports 3(3): 24-50 (2013) - 2012
- [j75]A. C. C. van Wijk, Ivo J. B. F. Adan, Onno J. Boxma, Adam Wierman:
Fairness and efficiency for polling models with the k-gated service discipline. Perform. Evaluation 69(6): 274-288 (2012) - [j74]Urtzi Ayesta, Onno J. Boxma, Ina Maria Verloop:
Sojourn times in a processor sharing queue with multiple vacations. Queueing Syst. Theory Appl. 71(1-2): 53-78 (2012) - 2011
- [j73]Onno J. Boxma, Offer Kella, K. M. Kosinski:
Queue lengths and workloads in polling systems. Oper. Res. Lett. 39(6): 401-405 (2011) - [j72]Onno J. Boxma, David Perry, Wolfgang Stadje:
The M/G/1+G queue revisited. Queueing Syst. Theory Appl. 67(3): 207-220 (2011) - [j71]K. M. Kosinski, Onno J. Boxma, Bert Zwart:
Convergence of the all-time supremum of a Lévy process in the heavy-traffic regime. Queueing Syst. Theory Appl. 67(4): 295-304 (2011) - [j70]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) - [j69]Onno J. Boxma, Denis Denisov:
Sojourn time tails in the single server queue with heavy-tailed service times. Queueing Syst. Theory Appl. 69(2): 101-119 (2011) - [c19]Onno J. Boxma, B. J. Prabhu:
Analysis of an M/G/1 queue with customer impatience and adaptive arrival process. NetGCoop 2011: 1-4 - 2010
- [j68]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) - [j67]Ahmad Al Hanbali, Onno J. Boxma:
Busy period analysis of the state dependent M/M/1/K queue. Oper. Res. Lett. 38(1): 1-6 (2010) - [j66]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) - [j65]Offer Kella, Onno J. Boxma, Michel Mandjes:
On Lévy-driven vacation models with correlated busy periods and service interruptions. Queueing Syst. Theory Appl. 64(4): 359-382 (2010) - [j64]Joris Walraevens, J. S. H. van Leeuwaarden, Onno J. Boxma:
Power series approximations for two-class generalized processor sharing systems. Queueing Syst. Theory Appl. 66(2): 107-130 (2010) - [j63]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
- [j62]Maria Vlasiou, Ivo J. B. F. Adan, Onno J. Boxma:
A two-station queue with dependent preparation and service times. Eur. J. Oper. Res. 195(1): 104-116 (2009) - [j61]Shaul K. Bar-Lev, Onno J. Boxma, Wolfgang Stadje, Frank A. Van der Duyn Schouten, Christoph Wiesmeyr:
Two-stage queueing network models for quality control and testing. Eur. J. Oper. Res. 198(3): 859-866 (2009) - [j60]Hwee Pink Tan, Rudesindo Núñez-Queija, Adriana Felicia Gabor, Onno J. Boxma:
Admission control for differentiated services in future generation CDMA networks. Perform. Evaluation 66(9-10): 488-504 (2009) - [j59]Onno J. Boxma, Josine Bruin, Brian H. Fralix:
Sojourn times in polling systems with various service disciplines. Perform. Evaluation 66(11): 621-639 (2009) - [j58]Onno J. Boxma:
Editorial introduction. Queueing Syst. Theory Appl. 61(2-3): 85 (2009) - [j57]Søren Asmussen, Onno J. Boxma:
Editorial introduction. Queueing Syst. Theory Appl. 63(1-4): 1-2 (2009) - 2008
- [j56]Onno J. Boxma:
Editorial introduction. Queueing Syst. Theory Appl. 58(1): 1-2 (2008) - [c18]Onno J. Boxma, A. C. C. van Wijk, Ivo J. B. F. Adan:
Polling systems with a gated/exhaustive discipline. VALUETOOLS 2008: 41 - [c17]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 - 2007
- [j55]Adam Wierman, Erik M. M. Winands, Onno J. Boxma:
Scheduling in polling systems. Perform. Evaluation 64(9-12): 1009-1028 (2007) - [j54]Onno J. Boxma, Maria Vlasiou:
On queues with service and interarrival times depending on waiting times. Queueing Syst. Theory Appl. 56(3-4): 121-132 (2007) - [j53]Onno J. Boxma, Bert Zwart:
Tails in scheduling. SIGMETRICS Perform. Evaluation Rev. 34(4): 13-20 (2007) - [c16]Onno J. Boxma, Vinod Sharma, D. K. Prasad:
Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time. ITC 2007: 568-581 - 2006
- [j52]Mark S. van den Broek, J. S. H. van Leeuwaarden, Ivo J. B. F. Adan, Onno J. Boxma:
Bounds and Approximations for the Fixed-Cycle Traffic-Light Queue. Transp. Sci. 40(4): 484-496 (2006) - 2005
- [j51]Ivo J. B. F. Adan, Onno J. Boxma, David Perry:
The G/M/1 queue revisited. Math. Methods Oper. Res. 62(3): 437-452 (2005) - [j50]Onno J. Boxma:
Editorial. Queueing Syst. Theory Appl. 49(1): 5-6 (2005) - 2004
- [j49]Onno J. Boxma, Serguei Foss, Jean-Marc Lasgouttes, R. Núñez Queija:
Waiting Time Asymptotics in the Single Server Queue with Service in Random Order. Queueing Syst. Theory Appl. 46(1-2): 35-73 (2004) - [j48]René Bekker, Sem C. Borst, Onno J. Boxma, Offer Kella:
Queues with Workload-Dependent Arrival and Service Rates. Queueing Syst. Theory Appl. 46(3-4): 537-556 (2004) - 2003
- [j47]Sem C. Borst, Onno J. Boxma, John A. Morrison, R. Núñez Queija:
The equivalence between processor sharing and service in random order. Oper. Res. Lett. 31(3): 254-262 (2003) - [j46]Onno J. Boxma, Dee Denteneer, Jacques Resing:
Delay models for contention trees in closed populations. Perform. Evaluation 53(3-4): 169-185 (2003) - [j45]Sem C. Borst, Onno J. Boxma, R. Núñez Queija, A. P. Zwart:
The impact of the service discipline on delay asymptotics. Perform. Evaluation 54(2): 175-206 (2003) - [j44]Sem C. Borst, Onno J. Boxma, Miranda van Uitert:
The Asymptotic Workload Behavior of Two Coupled Queues. Queueing Syst. Theory Appl. 43(1-2): 81-102 (2003) - [j43]Sem C. Borst, Onno J. Boxma, Predrag R. Jelenkovic:
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows. Queueing Syst. Theory Appl. 43(4): 273-306 (2003) - [j42]Zbigniew Palmowski, Sabine Schlegel, Onno J. Boxma:
A Tandem Queue with a Gate Mechanism. Queueing Syst. Theory Appl. 43(4): 349-364 (2003) - [j41]Onno J. Boxma, Tetsuya Takine:
The M/G/1 FIFO Queue with Several Customer Classes. Queueing Syst. Theory Appl. 45(3): 185-189 (2003) - [j40]Sem C. Borst, Onno J. Boxma, Jan Friso Groote, Sjouke Mauw:
Task Allocation in a Multi-Server System. J. Sched. 6(5): 423-436 (2003) - 2002
- [j39]Onno J. Boxma, Sabine Schlegel, Uri Yechiali:
Two-Queue Polling Models with a Patient Server. Ann. Oper. Res. 112(1-4): 101-121 (2002) - [j38]Onno J. Boxma, Qing Deng, Albertus Petrus Zwart:
Waiting-Time Asymptotics for the M/G/2 Queue with Heterogeneous Servers. Queueing Syst. Theory Appl. 40(1): 5-31 (2002) - [c15]Sem C. Borst, Onno J. Boxma, R. Núñez Queija:
Heavy Tails: The Effect of the Service Discipline. Computer Performance Evaluation / TOOLS 2002: 1-30 - [c14]Onno J. Boxma, Dee Denteneer, Jacques Resing:
Some Models for Contention Resolution in Cable Networks. NETWORKING 2002: 117-128 - 2001
- [j37]Onno J. Boxma, David Perry:
A queueing model with dependence between service and interarrival times. Eur. J. Oper. Res. 128(3): 611-624 (2001) - [j36]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) - [j35]Onno J. Boxma, David Perry, Wolfgang Stadje:
Clearing Models for M/G/1 Queues. Queueing Syst. Theory Appl. 38(3): 287-306 (2001) - 2000
- [j34]Onno J. Boxma, Qing Deng:
Asymptotic behaviour of the tandem queueing system with identical service times at both queues. Math. Methods Oper. Res. 52(2): 307-323 (2000) - [j33]A. P. Zwart, Onno J. Boxma:
Sojourn time asymptotics in the MG1 processor sharing queue. Queueing Syst. Theory Appl. 35(1-4): 141-166 (2000) - [c13]Sem C. Borst, Onno J. Boxma, Predrag R. Jelenkovic:
Coupled Processors with Regularly Varying Service Times. INFOCOM 2000: 157-164 - [c12]Sem C. Borst, Onno J. Boxma, Predrag R. Jelenkovic:
Asymptotic Behavior of Generalized Processor Sharing with Long-Tailed Traffic Sources. INFOCOM 2000: 912-921
1990 – 1999
- 1999
- [j32]Onno J. Boxma, J. W. Cohen:
Heavy-Traffic Analysis for the GI/G/1 Queue with Heavy-Tailed Distributions. Queueing Syst. Theory Appl. 33(1-3): 177-204 (1999) - 1998
- [j31]Onno J. Boxma, Vincent Dumas:
Fluid queues with long-tailed activity period distributions. Comput. Commun. 21(17): 1509-1529 (1998) - [j30]Onno J. Boxma, J. W. Cohen:
The M/G/1 queue with heavy-tailed service time distribution. IEEE J. Sel. Areas Commun. 16(5): 749-763 (1998) - [c11]Onno J. Boxma, Vincent Dumas:
The Busy Period in the Fluid Queue. SIGMETRICS 1998: 100-110 - 1997
- [j29]Sem C. Borst, Onno J. Boxma:
Polling Models With and Without Switchover Times. Oper. Res. 45(4): 536-543 (1997) - [j28]Onno J. Boxma, R. Núñez Queija:
Preface to Author and Subject Indexes, Volumes 1-21. Queueing Syst. Theory Appl. 24: 177-178 (1997) - [j27]Onno J. Boxma, R. Núñez Queija:
Author Index, Volumes 1-21. Queueing Syst. Theory Appl. 24: 179-212 (1997) - [j26]Onno J. Boxma, R. Núñez Queija:
Subject Index, Volumes 1-21. Queueing Syst. Theory Appl. 24: 213-309 (1997) - 1996
- [j25]Onno J. Boxma:
Fluid Queues and Regular Variation. Perform. Evaluation 27/28(4): 699-712 (1996) - [j24]Nimrod Bayer, Onno J. Boxma:
Wiener-Hopf Analysis of an M/G/1 Queue with Negative Customers and of a Related Class of Random Walks. Queueing Syst. Theory Appl. 23: 301-316 (1996) - 1995
- [j23]Sem C. Borst, Onno J. Boxma, Hanoch Levy:
The use of service limits for efficient operation of multistation single-medium communication systems. IEEE/ACM Trans. Netw. 3(5): 602-612 (1995) - [c10]Onno J. Boxma, Ger Koole, Isi Mitrani:
A Two-Queue Polling Model with a Threshold Service Policy. MASCOTS 1995: 84-88 - [c9]Erol Gelenbe, Peter G. Harrison, Edwige Pitel, Onno J. Boxma, Jean-Michel Fourneau:
G-Networks - New Queueing Models with Additional Control Capabilities (Panel). SIGMETRICS 1995: 58-59 - 1994
- [j22]Onno J. Boxma, M. Kelbert:
Stochastic bounds for a polling system. Ann. Oper. Res. 48(3): 295-310 (1994) - [j21]Onno J. Boxma, J. A. C. Resing:
Tandem queues with deterministic service times. Ann. Oper. Res. 49(1): 221-239 (1994) - [j20]M. B. Combé, Onno J. Boxma:
Optimization of Static Traffic Allocation Policies. Theor. Comput. Sci. 125(1): 17-43 (1994) - [j19]Simon C. Borst, Onno J. Boxma, J. H. A. Harink, George B. Huitema:
Optimization of fixed time polling schemes. Telecommun. Syst. 3(1): 31-59 (1994) - 1993
- [j18]Onno J. Boxma, Hanoch Levy, Jan A. Weststrate:
Efficient Visit Orders for Polling Systems. Perform. Evaluation 18(2): 103-123 (1993) - 1992
- [j17]Onno J. Boxma, Hanoch Levy, Uri Yechiali:
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Ann. Oper. Res. 35(3): 187-208 (1992) - [j16]Onno J. Boxma, Hideaki Takagi:
Editorial introduction. Queueing Syst. Theory Appl. 11(1-2): 1-5 (1992) - [c8]Sem C. Borst, Onno J. Boxma, M. B. Combé:
Collection of Customers: a Correlated M/G/1 Queue. SIGMETRICS 1992: 47-59 - 1991
- [j15]Onno J. Boxma, Gerard A. P. Kindervater:
A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master-Slave Architecture. Oper. Res. 39(6): 1005-1017 (1991) - [j14]Onno J. Boxma, J. W. Cohen:
The M/G/1 Queue with Permanent Customers. IEEE J. Sel. Areas Commun. 9(2): 179-184 (1991) - [j13]Onno J. Boxma, Hanoch Levy, Jan A. Weststrate:
Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost. Queueing Syst. Theory Appl. 9(1-2): 133-162 (1991) - [j12]J. L. van den Berg, Onno J. Boxma:
TheM/G/1 queue with processor sharing and its relation to a feedback queue. Queueing Syst. Theory Appl. 9(4): 365-401 (1991) - 1990
- [j11]Hanoch Levy, Moshe Sidi, Onno J. Boxma:
Dominance Relations in Polling Systems. Queueing Syst. Theory Appl. 6(2): 155-171 (1990) - [j10]Onno J. Boxma, Wim P. Groenendijk, Jan A. Weststrate:
A pseudoconservation law for service systems with a polling table. IEEE Trans. Commun. 38(10): 1865-1870 (1990) - [c7]Onno J. Boxma, Hanoch Levy, Jan A. Weststrate:
Optimization of Polling Systems. Performance 1990: 349-361
1980 – 1989
- 1989
- [j9]Onno J. Boxma:
Workloads and Waiting Times in Single-Server Systems with Multiple Customer Classes. Queueing Syst. Theory Appl. 5(1-3): 185-214 (1989) - [c6]Onno J. Boxma, Jan A. Weststrate:
Waiting Times in Polling Systems with Markovian Server Routing. MMB 1989: 89-104 - [c5]Onno J. Boxma, Wim P. Groenendijk, Jan A. Weststrate:
A Pseudoconservation Law for Service Systems with a Polling Table. SIGMETRICS 1989: 223 - 1988
- [j8]Onno J. Boxma, Wim P. Groenendijk:
Waiting times in discrete-time cyclic-service systems. IEEE Trans. Commun. 36(2): 164-170 (1988) - [e1]Giuseppe Iazeolla, Pierre-Jacques Courtois, Onno J. Boxma:
Computer Performance and Reliability, Proceedings of the Second International MCPR Workshop held in Rome, Italy, May 25-29, 1987. North-Holland 1988, ISBN 0-444-70342-X [contents] - 1987
- [j7]Onno J. Boxma, Bernd Werner Meister:
Waiting-Time Approximations in Multi-Queue Systems with Cyclic Service. Perform. Evaluation 7(1): 59-70 (1987) - [j6]Onno J. Boxma, Bernd Werner Meister:
Waiting-Time Approximations for Cyclic-Service Systems with Switchover Times. Perform. Evaluation 7(4): 299-308 (1987) - [c4]Onno J. Boxma:
Sojourn Times in Cyclic Queues - The Influence of the Slowest Server. Computer Performance and Reliability 1987: 13-24 - 1986
- [c3]Onno J. Boxma, Bernd Werner Meister:
Waiting-Time Approximations for Cyclic-Service Systems with Switch-Over Times. SIGMETRICS 1986: 254-262 - 1984
- [j5]Onno J. Boxma, Frank P. Kelly, Alan G. Konheim:
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues. J. ACM 31(1): 128-133 (1984) - [c2]Onno J. Boxma:
Two Symmmetric Queues with Alternating Service and Switching Times. Performance 1984: 409-431 - [c1]Onno J. Boxma:
A Probabilistic Analysis of the LPT Scheduling Rule. Performance 1984: 475-490 - 1982
- [j4]Onno J. Boxma, P. Donk:
On response time and cycle time distributions in a two-stage cyclic queue. Perform. Evaluation 2(3): 181-194 (1982) - 1981
- [j3]Onno J. Boxma, Alan G. Konheim:
Approximate Analysis of Exponential Queueing Systems with Blocking. Acta Informatica 15: 19-66 (1981) - 1980
- [j2]Onno J. Boxma:
The longest service time in a busy period. Z. Oper. Research 24(7): 235-242 (1980)
1970 – 1979
- 1979
- [j1]Onno J. Boxma, J. W. Cohen, N. Huffels:
Approximations of the Mean Waiting Time in an M/G/s Queueing System. Oper. Res. 27(6): 1115-1127 (1979)
Coauthor Index
Ivo J. B. F. Adan
aka: Ivo Adan
aka: Ivo Adan
Marko A. A. Boon
aka: Marko Boon
aka: Marko Boon
Sem C. Borst
aka: Simon C. Borst
aka: Simon C. Borst
Michel Mandjes
aka: M. R. H. Mandjes
aka: M. R. H. Mandjes
R. Núñez Queija
aka: Rudesindo Núñez-Queija
aka: Rudesindo Núñez-Queija
Jacques Resing
aka: J. A. C. Resing
aka: J. A. C. Resing
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-12-10 20:50 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:
