Onno Boxma

Articles in Scholarly Journals [Incomplete List]

  1. An M/G/1 Queue with Adaptable Service Speed
    Stochastic Models, vol. 23, no. 3, pp. 373–396, 2007
  2. Bounds and Approximations for the Fixed-Cycle Traffic-Light Queue
    Transportation Science, vol. 40, no. 4, pp. 484–496, 2006
  3. SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
    Probability in the Engineering and Informational Sciences, vol. 20, no. 03, 2006
  4. A Lévy process reflected at a Poisson age process
    Journal of Applied Probability, vol. 43, no. 1, pp. 221–230, 2006
  5. A Markovian growth-collapse model
    Advances in Applied Probability, vol. 38, no. 1, pp. 221–243, 2006
  6. Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues
    AEU - International Journal of Electronics and Communications, vol. 60, no. 2, pp. 109–115, 2006
  7. On the discounted penalty function in a Markov-dependent risk model
    Insurance: Mathematics and Economics, vol. 37, no. 3, pp. 650–672, 2005
  8. The G/M/1 queue revisited
    Mathematical Methods of Operations Research, vol. 62, no. 3, pp. 437–452, 2005
  9. Some time-dependent properties of symmetric M/G/1 queues
    Journal of Applied Probability, vol. 42, no. 1, pp. 223–234, 2005
  10. Waiting Time Asymptotics in the Single Server Queue with Service in Random Order
    Queueing Systems, vol. 46, no. 1/2, pp. 35–73, 2004
  11. Queues with Workload-Dependent Arrival and Service Rates
    Queueing Systems, vol. 46, no. 3/4, pp. 537–556, 2004
  12. A ruin model with dependence between claim sizes and claim intervals☆
    Insurance: Mathematics and Economics, vol. 35, no. 2, pp. 245–254, 2004
  13. Queueing Systems, vol. 43, no. 4, pp. 273–306, 2003
  14. The equivalence between processor sharing and service in random order
    Operations Research Letters, vol. 31, no. 4, pp. 254–262, 2003
  15. Delay models for contention trees in closed populations
    Performance Evaluation, vol. 53, no. 3-4, pp. 169–185, 2003
  16. The impact of the service discipline on delay asymptotics
    Performance Evaluation, vol. 54, no. 2, pp. 175–206, 2003
  17. Journal of Scheduling, vol. 6, no. 5, pp. 423–436, 2003
  18. On the integral of the workload process of the single server queue
    Journal of Applied Probability, vol. 40, no. 1, pp. 200–225, 2003
  19. Queueing Systems, vol. 43, no. 4, pp. 349–364, 2003
  20. Queueing Systems, vol. 43, no. 1/2, pp. 81–102, 2003
  21. Queueing Systems, vol. 45, no. 3, pp. 185–189, 2003
  22. Queueing Systems, vol. 40, no. 1, pp. 5–31, 2002
  23. Annals of Operations Research, vol. 112, no. 1/4, pp. 101–121, 2002
  24. Queueing Systems, vol. 38, no. 3, pp. 287–306, 2001
  25. AN INTERMITTENT FLUID SYSTEM WITH EXPONENTIAL ON-TIMES AND SEMI-MARKOV INPUT RATES
    Probability in the Engineering and Informational Sciences, vol. 15, no. 2, pp. 189–198, 2001
  26. Queueing Systems, vol. 37, no. 1/3, pp. 65–98, 2001
  27. A queueing model with dependence between service and interarrival times
    European Journal of Operational Research, vol. 128, no. 3, pp. 611–624, 2001
  28. The M / G /1 queue with two service speeds
    Advances in Applied Probability, vol. 33, no. 2, pp. 520–540, 2001
  29. Asymptotic behaviour of the tandem queueing system with identical service times at both queues
    Mathematical Methods of Operations Research (ZOR), vol. 52, no. 2, pp. 307–323, 2000
  30. Queueing Systems, vol. 35, no. 1/4, pp. 141–166, 2000
  31. The M/M\1 queue in a heavy-tailed random environment
    Statistica Neerlandica, vol. 54, no. 2, pp. 221–236, 2000
  32. Queueing Systems, vol. 33, no. 1/3, pp. 177–204, 1999
  33. FLUID QUEUES AND MOUNTAIN PROCESSES
    Probability in the Engineering and Informational Sciences, vol. 13, no. 4, pp. 407–427, 1999
  34. The M/G/1 queue with heavy-tailed service time distribution
    IEEE Journal on Selected Areas in Communications, vol. 16, no. 5, pp. 749–763, 1998
  35. The busy period in the fluid queue
    ACM SIGMETRICS Performance Evaluation Review, vol. 26, no. 1, pp. 100–110, 1998
  36. Fluid queues with long-tailed activity period distributions
    Computer Communications, vol. 21, no. 17, pp. 1509–1529, 1998
  37. Dynamic server assignment in a two-queue model
    European Journal of Operational Research, vol. 103, no. 3, pp. 595–609, 1997
  38. An M/G/1 Queue with Multiple Types of Feedback and Gated Vacations
    Journal of Applied Probability, vol. 34, no. 3, p. 773, 1997
  39. Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks
    Queueing Systems, vol. 23, no. 1-4, pp. 301–316, 1996
  40. The use of service limits for efficient operation of multistation single-medium communication systems
    IEEE/ACM Transactions on Networking, vol. 3, no. 5, pp. 602–612, 1995
  41. Optimization of fixed time polling schemes
    Telecommunication Systems, vol. 3, no. 1, pp. 31–59, 1994
  42. Tandem queues with deterministic service times
    Annals of Operations Research, vol. 49, no. 1, pp. 221–239, 1994
  43. Optimization of static traffic allocation policies
    Theoretical Computer Science, vol. 125, no. 1, pp. 17–43, 1994
  44. Stochastic bounds for a polling system
    Annals of Operations Research, vol. 48, no. 3, pp. 295–310, 1994
  45. Efficient visit orders for polling systems
    Performance Evaluation, vol. 18, no. 2, pp. 103–123, 1993
  46. Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
    Annals of Operations Research, vol. 35, no. 3, pp. 187–208, 1992
  47. Distribution of the workload in multiclass queueing systems with server vacations
    Naval Research Logistics, vol. 39, no. 1, pp. 41–52, 1992
  48. TheM/G/1 queue with processor sharing and its relation to a feedback queue
    Queueing Systems, vol. 9, no. 4, pp. 365–401, 1991
  49. Efficient visit frequencies for polling tables: minimization of waiting cost
    Queueing Systems, vol. 9, no. 1-2, pp. 133–162, 1991
  50. The M/G/1 queue with permanent customers
    IEEE Journal on Selected Areas in Communications, vol. 9, no. 2, pp. 179–184, 1991
  51. A pseudoconservation law for service systems with a polling table
    IEEE Transactions on Communications, vol. 38, no. 10, pp. 1865–1870, 1990
  52. Machine allocation problems in manufacturing networks
    European Journal of Operational Research, vol. 45, no. 1, pp. 47–54, 1990
  53. Dominance relations in polling systems
    Queueing Systems, vol. 6, no. 1, pp. 155–171, 1990
  54. Workloads and waiting times in single-server systems with multiple customer classes
    Queueing Systems, vol. 5, no. 1-3, pp. 185–214, 1989
  55. Waiting times in discrete-time cyclic-service systems
    IEEE Transactions on Communications, vol. 36, no. 2, pp. 164–170, 1988
  56. Waiting-time approximations in multi-queue systems with cyclic service
    Performance Evaluation, vol. 7, no. 1, pp. 59–70, 1987
  57. Waiting-time approximations for cyclic-service systems with switchover times
    Performance Evaluation, vol. 7, no. 4, pp. 299–308, 1987
  58. Minimizing the expected weighted number of tardy jobs in stochastic flow shops
    Operations Research Letters, vol. 5, no. 3, pp. 119–126, 1986
  59. A queueing model of finite and infinite source interaction
    Operations Research Letters, vol. 5, no. 5, pp. 245–254, 1986
  60. Waiting-time approximations for cyclic-service systems with switch-over times
    ACM SIGMETRICS Performance Evaluation Review, vol. 14, no. 1, pp. 254–262, 1986
  61. The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
    Journal of the ACM, vol. 31, no. 1, pp. 128–133, 1984
  62. Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacity
    European Journal of Operational Research, vol. 16, no. 2, pp. 246–256, 1984
  63. M/G/∞ tandem queues
    Stochastic Processes and their Applications, vol. 18, no. 1, pp. 153–164, 1984
  64. The Cyclic Queue with One General and One Exponential Server
    Advances in Applied Probability, vol. 15, no. 4, p. 857, 1983
  65. On response time and cycle time distributions in a two-stage cyclic queue
    Performance Evaluation, vol. 2, no. 3, pp. 181–194, 1982
  66. The longest service time in a busy period
    Zeitschrift für Operations Research, vol. 24, no. 7, pp. 235–242, 1980
  67. Approximate analysis of exponential queueing systems with blocking
    Acta Informatica, vol. 15, no. 1, pp. 19–66, 1980
  68. On a Tandem Queueing Model with Identical Service Times at Both Counters, I
    Advances in Applied Probability, vol. 11, no. 3, p. 616, 1979
  69. On the longest service time in a busy period of the MG1 queue
    Stochastic Processes and their Applications, vol. 8, no. 1, pp. 93–100, 1978
  70. The Single-Server Queue with Random Service Output
    Journal of Applied Probability, vol. 12, no. 4, p. 763, 1975