Approximations of the Mean Waiting Time in an M/G/s Queueing System. - Onno J. Boxma; J. W. Cohen; N. Huffels (Oper. Res., 1979)

The longest service time in a busy period. - Onno J. Boxma (Z. Oper. Research, 1980)

Approximate Analysis of Exponential Queueing Systems with Blocking. - Onno J. Boxma; Alan G. Konheim (Acta Informatica, 1981)

On response time and cycle time distributions in a two-stage cyclic queue. - Onno J. Boxma; P. Donk (Perform. Evaluation, 1982)

Two Symmmetric Queues with Alternating Service and Switching Times. - Onno J. Boxma (Performance, 1984)

A Probabilistic Analysis of the LPT Scheduling Rule. - Onno J. Boxma (Performance, 1984)

The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues. - Onno J. Boxma; Frank P. Kelly; Alan G. Konheim (J. ACM, 1984)

Waiting-Time Approximations for Cyclic-Service Systems with Switch-Over Times. - Onno J. Boxma; Bernd Werner Meister (SIGMETRICS, 1986)

Sojourn Times in Cyclic Queues - The Influence of the Slowest Server. - Onno J. Boxma (Computer Performance and Reliability, 1987)

Waiting-Time Approximations in Multi-Queue Systems with Cyclic Service. - Onno J. Boxma; Bernd Werner Meister (Perform. Evaluation, 1987)

Waiting-Time Approximations for Cyclic-Service Systems with Switchover Times. - Onno J. Boxma; Bernd Werner Meister (Perform. Evaluation, 1987)

Waiting times in discrete-time cyclic-service systems. - Onno J. Boxma; Wim P. Groenendijk (IEEE Trans. Commun., 1988)

Waiting Times in Polling Systems with Markovian Server Routing. - Onno J. Boxma; Jan A. Weststrate (MMB, 1989)

Workloads and Waiting Times in Single-Server Systems with Multiple Customer Classes. - Onno J. Boxma (Queueing Syst. Theory Appl., 1989)

Optimization of Polling Systems. - Onno J. Boxma; Hanoch Levy; Jan A. Weststrate (Performance, 1990)

Dominance Relations in Polling Systems. - Hanoch Levy; Moshe Sidi; Onno J. Boxma (Queueing Syst. Theory Appl., 1990)

A pseudoconservation law for service systems with a polling table. - Onno J. Boxma; Wim P. Groenendijk; Jan A. Weststrate (IEEE Trans. Commun., 1990)

A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master-Slave Architecture. - Onno J. Boxma; Gerard A. P. Kindervater (Oper. Res., 1991)

The M/G/1 Queue with Permanent Customers. - Onno J. Boxma; J. W. Cohen (IEEE J. Sel. Areas Commun., 1991)

TheM/G/1 queue with processor sharing and its relation to a feedback queue. - J. L. van den Berg; Onno J. Boxma (Queueing Syst. Theory Appl., 1991)

Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost. - Onno J. Boxma; Hanoch Levy; Jan A. Weststrate (Queueing Syst. Theory Appl., 1991)

Collection of Customers: a Correlated M/G/1 Queue. - Sem C. Borst; Onno J. Boxma; M. B. Combé (SIGMETRICS, 1992)

Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. - Onno J. Boxma; Hanoch Levy; Uri Yechiali (Ann. Oper. Res., 1992)

Editorial introduction. - Onno J. Boxma; Hideaki Takagi (Queueing Syst. Theory Appl., 1992)

Efficient Visit Orders for Polling Systems. - Onno J. Boxma; Hanoch Levy; Jan A. Weststrate (Perform. Evaluation, 1993)

Stochastic bounds for a polling system. - Onno J. Boxma; M. Kelbert (Ann. Oper. Res., 1994)

Tandem queues with deterministic service times. - Onno J. Boxma; J. A. C. Resing (Ann. Oper. Res., 1994)

Optimization of Static Traffic Allocation Policies. - M. B. Combé; Onno J. Boxma (Theor. Comput. Sci., 1994)

Optimization of fixed time polling schemes. - Simon C. Borst; Onno J. Boxma; J. H. A. Harink; George B. Huitema (Telecommun. Syst., 1994)

A Two-Queue Polling Model with a Threshold Service Policy. - Onno J. Boxma; Ger Koole; Isi Mitrani (MASCOTS, 1995)

G-Networks - New Queueing Models with Additional Control Capabilities (Panel). - Erol Gelenbe; Peter G. Harrison; Edwige Pitel; Onno J. Boxma; Jean-Michel Fourneau (SIGMETRICS, 1995)

The use of service limits for efficient operation of multistation single-medium communication systems. - Sem C. Borst; Onno J. Boxma; Hanoch Levy (IEEE/ACM Trans. Netw., 1995)

Fluid Queues and Regular Variation. - Onno J. Boxma (Perform. Evaluation, 1996)

Wiener-Hopf Analysis of an M/G/1 Queue with Negative Customers and of a Related Class of Random Walks. - Nimrod Bayer; Onno J. Boxma (Queueing Syst. Theory Appl., 1996)

Polling Models With and Without Switchover Times. - Sem C. Borst; Onno J. Boxma (Oper. Res., 1997)

Preface to Author and Subject Indexes, Volumes 1-21. - Onno J. Boxma; R. Núñez Queija (Queueing Syst. Theory Appl., 1997)

Author Index, Volumes 1-21. - Onno J. Boxma; R. Núñez Queija (Queueing Syst. Theory Appl., 1997)

Subject Index, Volumes 1-21. - Onno J. Boxma; R. Núñez Queija (Queueing Syst. Theory Appl., 1997)

The Busy Period in the Fluid Queue. - Onno J. Boxma; Vincent Dumas (SIGMETRICS, 1998)

Fluid queues with long-tailed activity period distributions. - Onno J. Boxma; Vincent Dumas (Comput. Commun., 1998)

The M/G/1 queue with heavy-tailed service time distribution. - Onno J. Boxma; J. W. Cohen (IEEE J. Sel. Areas Commun., 1998)

Heavy-Traffic Analysis for the GI/G/1 Queue with Heavy-Tailed Distributions. - Onno J. Boxma; J. W. Cohen (Queueing Syst. Theory Appl., 1999)

Coupled Processors with Regularly Varying Service Times. - Sem C. Borst; Onno J. Boxma; Predrag R. Jelenkovic (INFOCOM, 2000)

Asymptotic Behavior of Generalized Processor Sharing with Long-Tailed Traffic Sources. - Sem C. Borst; Onno J. Boxma; Predrag R. Jelenkovic (INFOCOM, 2000)

Asymptotic behaviour of the tandem queueing system with identical service times at both queues. - Onno J. Boxma; Qing Deng (Math. Methods Oper. Res., 2000)

Sojourn time asymptotics in the MG1 processor sharing queue. - A. P. Zwart; Onno J. Boxma (Queueing Syst. Theory Appl., 2000)

A queueing model with dependence between service and interarrival times. - Onno J. Boxma; David Perry (Eur. J. Oper. Res., 2001)

Queueing Models with Multiple Waiting Lines. - Ivo J. B. F. Adan; Onno J. Boxma; Jacques Resing (Queueing Syst. Theory Appl., 2001)

Clearing Models for M/G/1 Queues. - Onno J. Boxma; David Perry; Wolfgang Stadje (Queueing Syst. Theory Appl., 2001)

Heavy Tails: The Effect of the Service Discipline. - Sem C. Borst; Onno J. Boxma; R. Núñez Queija (Computer Performance Evaluation / TOOLS, 2002)

Some Models for Contention Resolution in Cable Networks. - Onno J. Boxma; Dee Denteneer; Jacques Resing (NETWORKING, 2002)

Two-Queue Polling Models with a Patient Server. - Onno J. Boxma; Sabine Schlegel; Uri Yechiali (Ann. Oper. Res., 2002)

Waiting-Time Asymptotics for the M/G/2 Queue with Heterogeneous Servers. - Onno J. Boxma; Qing Deng; Albertus Petrus Zwart (Queueing Syst. Theory Appl., 2002)

The equivalence between processor sharing and service in random order. - Sem C. Borst; Onno J. Boxma; John A. Morrison; R. Núñez Queija (Oper. Res. Lett., 2003)

The impact of the service discipline on delay asymptotics. - Sem C. Borst; Onno J. Boxma; R. Núñez Queija; A. P. Zwart (Perform. Evaluation, 2003)

Delay models for contention trees in closed populations. - Onno J. Boxma; Dee Denteneer; Jacques Resing (Perform. Evaluation, 2003)

Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows. - Sem C. Borst; Onno J. Boxma; Predrag R. Jelenkovic (Queueing Syst. Theory Appl., 2003)

The Asymptotic Workload Behavior of Two Coupled Queues. - Sem C. Borst; Onno J. Boxma; Miranda van Uitert (Queueing Syst. Theory Appl., 2003)

The M/G/1 FIFO Queue with Several Customer Classes. - Onno J. Boxma; Tetsuya Takine (Queueing Syst. Theory Appl., 2003)

A Tandem Queue with a Gate Mechanism. - Zbigniew Palmowski; Sabine Schlegel; Onno J. Boxma (Queueing Syst. Theory Appl., 2003)

Task Allocation in a Multi-Server System. - Sem C. Borst; Onno J. Boxma; Jan Friso Groote; Sjouke Mauw (J. Sched., 2003)

Queues with Workload-Dependent Arrival and Service Rates. - René Bekker; Sem C. Borst; Onno J. Boxma; Offer Kella (Queueing Syst. Theory Appl., 2004)

Waiting Time Asymptotics in the Single Server Queue with Service in Random Order. - Onno J. Boxma; Serguei Foss; Jean-Marc Lasgouttes; R. Núñez Queija (Queueing Syst. Theory Appl., 2004)

The G/M/1 queue revisited. - Ivo J. B. F. Adan; Onno J. Boxma; David Perry (Math. Methods Oper. Res., 2005)

Editorial. - Onno J. Boxma (Queueing Syst. Theory Appl., 2005)

Bounds and Approximations for the Fixed-Cycle Traffic-Light Queue. - Mark S. van den Broek; J. S. H. van Leeuwaarden; Ivo J. B. F. Adan; Onno J. Boxma (Transp. Sci., 2006)

Performance Analysis of a Fluid Queue with Random Service Rate in Discrete Time. - Onno J. Boxma; Vinod Sharma; D. K. Prasad (ITC, 2007)

Scheduling in polling systems. - Adam Wierman; Erik M. M. Winands; Onno J. Boxma (Perform. Evaluation, 2007)

On queues with service and interarrival times depending on waiting times. - Onno J. Boxma; Maria Vlasiou (Queueing Syst. Theory Appl., 2007)

Tails in scheduling. - Onno J. Boxma; Bert Zwart (SIGMETRICS Perform. Evaluation Rev., 2007)

Polling systems with a gated/exhaustive discipline. - Onno J. Boxma; A. C. C. van Wijk; Ivo J. B. F. Adan (VALUETOOLS, 2008)

Two-stage queueing network models for quality control and testing. - Shaul K. Bar-Lev; Onno J. Boxma; Wolfgang Stadje; Frank A. Van der Duyn Schouten; Christoph Wiesmeyr (Eur. J. Oper. Res., 2009)

A two-station queue with dependent preparation and service times. - Maria Vlasiou; Ivo J. B. F. Adan; Onno J. Boxma (Eur. J. Oper. Res., 2009)

Sojourn times in polling systems with various service disciplines. - Onno J. Boxma; Josine Bruin; Brian H. Fralix (Perform. Evaluation, 2009)

Admission control for differentiated services in future generation CDMA networks. - Hwee Pink Tan; Rudesindo Núñez-Queija; Adriana Felicia Gabor; Onno J. Boxma (Perform. Evaluation, 2009)

Editorial introduction. - Søren Asmussen; Onno J. Boxma (Queueing Syst. Theory Appl., 2009)

Editorial introduction. - Onno J. Boxma (Queueing Syst. Theory Appl., 2009)

A Two-Queue Polling Model with Two Priority Levels in the First Queue. - Marko A. A. Boon; Ivo J. B. F. Adan; Onno J. Boxma (Discret. Event Dyn. Syst., 2010)

Busy period analysis of the state dependent M/M/1/K queue. - Ahmad Al Hanbali; Onno J. Boxma (Oper. Res. Lett., 2010)

A polling model with multiple priority levels. - Marko A. A. Boon; Ivo J. B. F. Adan; Onno J. Boxma (Perform. Evaluation, 2010)

A polling model with smart customers. - Marko A. A. Boon; A. C. C. van Wijk; Ivo J. B. F. Adan; Onno J. Boxma (Queueing Syst. Theory Appl., 2010)

On Lévy-driven vacation models with correlated busy periods and service interruptions. - Offer Kella; Onno J. Boxma; Michel Mandjes (Queueing Syst. Theory Appl., 2010)

Power series approximations for two-class generalized processor sharing systems. - Joris Walraevens; J. S. H. van Leeuwaarden; Onno J. Boxma (Queueing Syst. Theory Appl., 2010)

Analysis of an M/G/1 queue with customer impatience and adaptive arrival process. - Onno J. Boxma; B. J. Prabhu (NetGCoop, 2011)

Queue lengths and workloads in polling systems. - Onno J. Boxma; Offer Kella; K. M. Kosinski (Oper. Res. Lett., 2011)

On open problems in polling systems. - Marko A. A. Boon; Onno J. Boxma; Erik M. M. Winands (Queueing Syst. Theory Appl., 2011)

Sojourn time tails in the single server queue with heavy-tailed service times. - Onno J. Boxma; Denis Denisov (Queueing Syst. Theory Appl., 2011)

The M/G/1+G queue revisited. - Onno J. Boxma; David Perry; Wolfgang Stadje (Queueing Syst. Theory Appl., 2011)

Convergence of the all-time supremum of a Lévy process in the heavy-traffic regime. - K. M. Kosinski; Onno J. Boxma; Bert Zwart (Queueing Syst. Theory Appl., 2011)

Fairness and efficiency for polling models with the k-gated service discipline. - A. C. C. van Wijk; Ivo J. B. F. Adan; Onno J. Boxma; Adam Wierman (Perform. Evaluation, 2012)

Sojourn times in a processor sharing queue with multiple vacations. - Urtzi Ayesta; Onno J. Boxma; Ina Maria Verloop (Queueing Syst. Theory Appl., 2012)

Scheduling (Dagstuhl Seminar 13111). - Susanne Albers; Onno J. Boxma; Kirk Pruhs (Dagstuhl Reports, 2013)

Factorization Identities for Reflected Processes, with Applications. - Brian H. Fralix; Johan S. H. van Leeuwaarden; Onno J. Boxma (J. Appl. Probab., 2013)

Useful Martingales for Stochastic Storage Processes with Lévy-Type Input. - Offer Kella; Onno J. Boxma (J. Appl. Probab., 2013)

Marginal queue length approximations for a two-layered network with correlated queues. - Jan-Pieter L. Dorsman; Onno J. Boxma; Maria Vlasiou (Queueing Syst. Theory Appl., 2013)

Repair systems with exchangeable items and the longest queue mechanism. - R. Ravid; Onno J. Boxma; David Perry (Queueing Syst. Theory Appl., 2013)

Vacation and Polling Models with Retrials. - Onno J. Boxma; Jacques Resing (EPEW, 2014)

Data dissemination performance in large-scale sensor networks. - Thomas M. M. Meyfroyt; Sem C. Borst; Onno J. Boxma; Dee Denteneer (SIGMETRICS, 2014)

On Simple Ruin Expressions in Dependent Sparre Andersen Risk Models. - Hansjörg Albrecher; Onno J. Boxma; Jevgenijs Ivanovs (J. Appl. Probab., 2014)

Queues with random back-offs. - Niek Bouman; Sem C. Borst; Onno J. Boxma; J. S. H. van Leeuwaarden (Queueing Syst. Theory Appl., 2014)

The cyclic queue and the tandem queue. - Onno J. Boxma; Hans Daduna (Queueing Syst. Theory Appl., 2014)

Decomposition results for stochastic storage processes and queues with alternating Lévy inputs. - Onno J. Boxma; Offer Kella (Queueing Syst. Theory Appl., 2014)

On two-queue Markovian polling systems with exhaustive service. - Jan-Pieter L. Dorsman; Onno J. Boxma; Robert D. van der Mei (Queueing Syst. Theory Appl., 2014)

Efficient Content Delivery in the Presence of Impatient Jobs. - Maialen Larrañaga; Onno J. Boxma; R. Núñez Queija; Mark S. Squillante (ITC, 2015)

A make-to-stock mountain-type inventory model. - Onno J. Boxma; Mahmut Parlar; David Perry (Ann. Oper. Res., 2015)

A Fluid EOQ Model of Perishable Items with Intermittent High and Low Demand Rates. - Onno J. Boxma; David Perry; Shelley Zacks (Math. Oper. Res., 2015)

Markovian polling systems with an application to wireless random-access networks. - Jan-Pieter L. Dorsman; Sem C. Borst; Onno J. Boxma; Maria Vlasiou (Perform. Evaluation, 2015)

A data propagation model for wireless gossiping. - Thomas M. M. Meyfroyt; Sem C. Borst; Onno J. Boxma; Dee Denteneer (Perform. Evaluation, 2015)

On the scalability and message count of Trickle-based broadcasting schemes. - Thomas M. M. Meyfroyt; Sem C. Borst; Onno J. Boxma; Dee Denteneer (Queueing Syst. Theory Appl., 2015)

Revenue maximization in an optical router node - allocation of service windows. - Murtuza Ali Abidini; Onno J. Boxma; Ton Koonen; Jacques Resing (ONDM, 2016)

The shorter queue polling model. - Ivo J. B. F. Adan; Onno J. Boxma; Stella Kapodistria; Vidyadhar G. Kulkarni (Ann. Oper. Res., 2016)

On a make-to-stock production/mountain modeln with hysteretic control. - Onno J. Boxma; Andreas Löpker; David Perry (Ann. Oper. Res., 2016)

Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations. - Dieter Claeys; Ivo J. B. F. Adan; Onno J. Boxma (Eur. J. Oper. Res., 2016)

On a class of reflected AR(1) processes. - Onno J. Boxma; Michel Mandjes; Josh Reed (J. Appl. Probab., 2016)

Analysis and optimization of vacation and polling models with retrials. - Murtuza Ali Abidini; Onno J. Boxma; Jacques Resing (Perform. Evaluation, 2016)

An ASIP model with general gate opening intervals. - Onno J. Boxma; Offer Kella; Uri Yechiali (Queueing Syst. Theory Appl., 2016)

Special volume on 'Methodological Advances in Queueing Theory' of the First ECQT Conference. - Onno J. Boxma; Joris Walraevens (Queueing Syst. Theory Appl., 2016)

Lajos Takács. - Onno J. Boxma; Shelemyahu Zacks (Queueing Syst. Theory Appl., 2016)

A tandem fluid network with Lévy input in heavy traffic. - David T. Koops; Onno J. Boxma; M. R. H. Mandjes (Queueing Syst. Theory Appl., 2016)

Size-based Routing to Balance Performance of the Queues. - Murtuza Ali Abidini; Onno J. Boxma; Josu Doncel (VALUETOOLS, 2017)

Computational methods and applications in queueing theory. - Onno J. Boxma; Joris Walraevens (Ann. Oper. Res., 2017)

Recycled incomplete identification procedures for blood screening. - Shaul K. Bar-Lev; Onno J. Boxma; Igor Kleiner; David Perry; Wolfgang Stadje (Eur. J. Oper. Res., 2017)

A reinsurance risk model with a threshold coverage policy: the Gerber-Shiu penalty function. - Onno J. Boxma; Esther Frostig; David Perry (J. Appl. Probab., 2017)

A single-server queue with batch arrivals and semi-Markov services. - Abhishek 002; Marko A. A. Boon; Onno J. Boxma; Rudesindo Núñez-Queija (Queueing Syst. Theory Appl., 2017)

Performance analysis of polling systems with retrials and glue periods. - Murtuza Ali Abidini; Onno J. Boxma; Bara Kim; Jeongsim Kim; Jacques Resing (Queueing Syst. Theory Appl., 2017)

Queue-length balance equations in multiclass multiserver queues and their generalizations. - Marko A. A. Boon; Onno J. Boxma; Offer Kella; Masakiyo Miyazawa (Queueing Syst. Theory Appl., 2017)

Networks of ( cdot /G/ infty ) queues with shot-noise-driven arrival intensities. - David T. Koops; Onno J. Boxma; M. R. H. Mandjes (Queueing Syst. Theory Appl., 2017)

Fluid flow models in performance analysis. - Onno J. Boxma; Bert Zwart (Comput. Commun., 2018)

Infinite-server queues with Hawkes input. - David T. Koops; Mayank Saxena; Onno J. Boxma; Michel Mandjes (J. Appl. Probab., 2018)

Delta probing policies for redundancy. - Youri Raaijmakers; Sem C. Borst; Onno J. Boxma (Perform. Evaluation, 2018)

Analysis of Mx/G/1 queues with impatient customers. - Yoshiaki Inoue; Onno J. Boxma; David Perry; Shelley Zacks (Queueing Syst. Theory Appl., 2018)

A Queueing System with Vacations after a Random Amount of Work. - Ivo Adan; Onno J. Boxma; Dieter Claeys; Offer Kella (SIAM J. Appl. Math., 2018)

A Single Server Queue with Workload-Dependent Service Speed and Vacations. - Yutaka Sakuma; Onno J. Boxma; Tuan Phung-Duc (QTNA, 2019)

Revenue Maximization in an Optical Router Node Using Multiple Wavelengths. - Murtuza Ali Abidini; Onno J. Boxma; Cor A. J. Hurkens; Ton Koonen; Jacques Resing (VALUETOOLS, 2019)

Fluid queues with synchronized output. - Onno J. Boxma; Offer Kella; Liron Ravner (Oper. Res. Lett., 2019)

The (S-1, S) inventory model and its counterparts in queueing theory. - Onno J. Boxma; David Perry; Wolfgang Stadje (Oper. Res. Lett., 2019)

Performance of large-scale polling systems with branching-type and limited service. - Thomas M. M. Meyfroyt; Marko A. A. Boon; Sem C. Borst; Onno J. Boxma (Perform. Evaluation, 2019)

Infinite-server systems with Coxian arrivals. - Onno J. Boxma; Offer Kella; Michel Mandjes (Queueing Syst. Theory Appl., 2019)

Redundancy scheduling with scaled Bernoulli service requirements. - Youri Raaijmakers; Sem C. Borst; Onno J. Boxma (Queueing Syst. Theory Appl., 2019)

Scaling analysis of an extended machine-repair model. - L. R. van Kreveld; Onno J. Boxma; Jan-Pieter L. Dorsman; M. R. H. Mandjes (VALUETOOLS, 2020)

Stability of Redundancy Systems with Processor Sharing. - Youri Raaijmakers; Sem C. Borst; Onno J. Boxma (VALUETOOLS, 2020)

On two classes of reflected autoregressive processes. - Onno J. Boxma; Andreas Löpker; Michel Mandjes (J. Appl. Probab., 2020)

Synchronized Lévy queues. - Offer Kella; Onno J. Boxma (J. Appl. Probab., 2020)

Censored lifetime learning: Optimal Bayesian age-replacement policies. - Collin Drent; Stella Kapodistria; Onno J. Boxma (Oper. Res. Lett., 2020)

Revenue maximization in optical router nodes. - Murtuza Ali Abidini; Onno J. Boxma; Cor A. J. Hurkens; Ton Koonen; Jacques Resing (Perform. Evaluation, 2020)

Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes. - Ziv Scully; Lucas van Kreveld; Onno J. Boxma; Jan-Pieter L. Dorsman; Adam Wierman (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Threshold-based rerouting and replication for resolving job-server affinity relations. - Youri Raaijmakers; Sem C. Borst; Onno J. Boxma (INFOCOM, 2021)

Affine Storage and Insurance Risk Models. - Onno J. Boxma; Michel Mandjes (Math. Oper. Res., 2021)

Scaling limits for closed product-form queueing networks. - L. R. van Kreveld; Onno J. Boxma; Jan-Pieter L. Dorsman; M. R. H. Mandjes (Perform. Evaluation, 2021)

Stability and tail behavior of redundancy systems with processor sharing. - Youri Raaijmakers; Sem C. Borst; Onno J. Boxma (Perform. Evaluation, 2021)

Workload distributions in ASIP queueing networks. - Onno J. Boxma; Offer Kella; Uri Yechiali (Queueing Syst. Theory Appl., 2021)

A multiplicative version of the Lindley recursion. - Onno J. Boxma; Andreas Löpker; Michel Mandjes; Zbigniew Palmowski (Queueing Syst. Theory Appl., 2021)

Shot-noise queueing models. - Onno J. Boxma; Michel Mandjes (Queueing Syst. Theory Appl., 2021)

An M/PH/1 queue with workload-dependent processing speed and vacations. - Yutaka Sakuma; Onno J. Boxma; Tuan Phung-Duc (Queueing Syst. Theory Appl., 2021)

A compound Poisson EOQ model for perishable items with intermittent high and low demand periods. - Onno J. Boxma; David Perry; Wolfgang Stadje; Shelley Zacks (Ann. Oper. Res., 2022)

Peer-to-Peer Lending: a Growth-Collapse Model and its Steady-State Analysis. - Onno J. Boxma; David Perry; Wolfgang Stadje (Math. Methods Oper. Res., 2022)

Functional equations with multiple recursive terms. - Ivo Adan; Onno J. Boxma; Jacques Resing (Queueing Syst. Theory Appl., 2022)

Editorial introduction to '100 views on queues'. - Marko Boon; Onno J. Boxma; Sergey Foss (Queueing Syst. Theory Appl., 2022)

Queueing and risk models with dependencies. - Onno J. Boxma; M. R. H. Mandjes (Queueing Syst. Theory Appl., 2022)

Fork-join and redundancy systems with heavy-tailed job sizes. - Youri Raaijmakers; Sem C. Borst; Onno J. Boxma (Queueing Syst. Theory Appl., 2023)

Stationary analysis of an (R, Q) inventory model with normal and emergency orders. - Onno J. Boxma; David Perry; Wolfgang Stadje (J. Appl. Probab., 2023)

Exact results for the order picking time distribution under return routing. - Tim Engels; Ivo Adan; Onno J. Boxma; Jacques Resing (Oper. Res. Lett., 2023)

State-Dependent Estimation of Delay Distributions in Fork-Join Networks. - Nitzan Carmeli; Galit B. Yom-Tov; Onno J. Boxma (Manuf. Serv. Oper. Manag., 2023)

A decomposition for Lévy processes inspected at Poisson moments. - Onno J. Boxma; Michel Mandjes (J. Appl. Probab., 2023)

Externalities in the M/G/1 queue: LCFS-PR versus FCFS. - Royi Jacobovic; Nikki Levering; Onno J. Boxma (Queueing Syst. Theory Appl., 2023)

Workload analysis of a two-queue fluid polling model. - Stella Kapodistria; Mayank Saxena; Onno J. Boxma; Offer Kella (J. Appl. Probab., 2023)

The number of overlapping customers. - Onno J. Boxma (Oper. Res. Lett., 2024)

ASIP tandem queues with consumption. - Yaron Yeger; Onno J. Boxma; Jacques Resing; Maria Vlasiou (Perform. Evaluation, 2024)

Perishable inventories with random input: a unifying survey with extensions. - Onno J. Boxma; David Perry; Wolfgang Stadje (Ann. Oper. Res., 2024)

An exact analysis and comparison of manual picker routing heuristics. - Tim Engels; Ivo Adan; Onno J. Boxma; Jacques Resing (Queueing Syst. Theory Appl., 2024)

Finite customer-pool queues. - Onno J. Boxma; Offer Kella; Michel Mandjes (Oper. Res. Lett., 2025)

Overlap times in the G/G/1 queue via Laplace transforms. - Onno J. Boxma; Jamol Pender (Queueing Syst. Theory Appl., 2025)