Richard Weber's Publications

Here is a list of my research publications with pointers to abstracts.

There is also BibTeX databases for stochastic scheduling and ATM research.

Publications 1978- 1986- 1990- 2000-

Papers in journals and refereed conference proceedings

  1. R.R. Weber. On the optimal assignment of customers to parallel servers. J. Appl. Prob. 15, 406-413, 1978. (abstract)
  2. R.R. Weber. The interchangeability of ./M/1 queues in series. J. Appl. Prob. 16, 690-695, 1979. (abstract)
  3. R.R. Weber and P. Nash. An optimal strategy in multi-server stochastic scheduling. J. R. Statist. Soc. B40, 322-327, 1979. (abstract)
  4. R.R. Weber. The Optimal Organization of Multiserver Systems. Ph.D. dissertation, Cambridge University, 1980.
  5. R.R. Weber. On the marginal benefit of adding servers to G/GI/m queues. Management Science 26(9), :946-951, 1980. (abstract)
  6. E.J. Anderson, P. Nash and R.R. Weber. A counterexample to a conjecture in optimal list ordering. J. Appl. Prob. 19, 730-732, 1982. (abstract)
  7. R.R. Weber and P. Nash. Dominant strategies in stochastic allocation and scheduling problems. In M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan, editors, Deterministic and Stochastic Scheduling pages 343-353. Reidel, 1982. (abstract)
  8. P. Nash and R.R. Weber. Sequential open-loop scheduling strategies. In M.A.H. Dempster, J.K. Lenstra, and A.H.G. Rinnooy Kan, editors, Deterministic and Stochastic Scheduling pages 385-398. Reidel, 1982. (abstract)
  9. R.R. Weber. Scheduling stochastic jobs on parallel machines to minimize makespan or flowtime. In R. Disney and T. Ott, editors, Applied Probability - Computer Science: The Interface. Birkhauser, Boston, MA, 1982.(abstract,)
  10. R.R. Weber. Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Prob. 19, 167-182, 1982. (abstract, paper)
  11. R.R. Weber. A note on waiting times in single server queues. Operations Research 31, 950-951, 1983.
  12. M. Pinedo and R.R. Weber. Inequalities and bounds in stochastic shop scheduling. SIAM J. of Appl. Math., 869-879, 1984.
  13. C. Courcoubetis and R.R. Weber. Necessary and sufficient conditions for stability of a bin-packing system. J. Appl. Prob. 23, 989-999, 1986. (abstract)
  14. C. Courcoubetis and R.R. Weber. A bin-packing system for objects from a finite set: necessary and sufficient conditions for stability and some applications. In Proc. of 25th IEEE CDC, Athens, Greece December 1986.
  15. R.R. Weber. Optimal search for a randomly moving object. J. Appl. Prob. 23:708-717, 1986. (abstract)
  16. R.R. Weber, P. Varaiya and J. Walrand. Scheduling jobs with stochastically ordered processing requirements to minimize expected flowtime. J. Appl. Prob. 23, 841-847, 1986. (abstract)
  17. E.G. Coffman, Jr, L. Flatto, M.R. Garey and R.R. Weber. Minimizing expected makespan on uniform processor systems. Adv. Appl. Prob. 19, 117-201, 1987. (abstract)
  18. E.G. Coffman, Jr, L. Flatto and R.R. Weber. Optimal selection of stochastic intervals under a sum constraint. Adv. Appl. Prob. 19, 454-473, 1987. (abstract)
  19. R.R. Weber and S. Stidham, Jr. Optimal control of service rates in networks of queues. Adv. Appl. Prob. 19, 202-218, 1987. (abstract)
  20. R.R. Weber. Stochastic scheduling on parallel processors and minimization of concave functions of completion times. In W. Fleming and P.L. Lions, editors, Stochastic Differential Systems, Stochastic Control Theory and Applications volume 10, pages 601-609. Springer-Verlag, New York, 1988. (abstract)
  21. C. Courcoubetis, P. Konstantopoulos, J. Walrand and R.R. Weber. Stabilizing an uncertain production system. Queueing Systems: Theory and Applications 5, 39-54, 1989.
  22. S. Stidham, Jr and R.R. Weber. Monotonic and insensitive optimal policies for the control of queues with undiscounted costs. Operations Research 37, 611-625, 1989. (abstract)
  23. C. Courcoubetis and R.R. Weber. The move-to-front rule for multiple lists. Probability in the Engineering and Information Sciences 4, 19-28, 1990. (abstract)
  24. R.R. Weber and G. Weiss. On an index policy for restless bandits, in U. Rieder, P. Gessner, A. Peyerimhoff and F.J. Radermacher, Methods of Operations Research: XIV Symposium on Operations Research, volume 62, 369-371, University of Ulm, September, 1989, Gesellschaft fur Mathematik, Okonomie und Operations Research e. V., Anton Hain.(abstract)
  25. E.J. Anderson and R.R. Weber. The rendezvous problem on discrete locations. J. Appl. Prob. 27, 839-851, 1990. (abstract and discussion)
  26. C. Courcoubetis and R.R. Weber. Stability of on-line bin packing with random arrivals and long-run average constraints. Probability in the Engineering and Information Sciences 4, 447-460, 1990. (abstract)
  27. C. Courcoubetis and R.R. Weber. Stable policies for Petri-nets with fluctuating transition processes. In Proc. of 29th IEEE CDC 1990.
  28. R.R. Weber and G. Weiss. On an index policy for restless bandits. J. Appl. Prob. 27, 637-648, 1990. (abstract)
  29. S.H. Xu, P.B. Mirchandani, S.P.R. Kumar and R.R. Weber. Stochastic dispatching of multi-priority jobs to heterogeneous processors. J. Appl. Prob. 27, 852-861, 1990. (abstract)
  30. E.G. Coffman, Jr C. Coucoubetis, M.R. Garey, D.S. Johnson, L.A. McGeoch, P.W. Shor, R.R. Weber, and M. Yannakakis. Fundamental discrepancies between average-case analyses under discrete and continuous distributions: A bin packing case study. In Proc. 23 Annual ACM Symposium on Theory of Computing, New Orleans, May 6-8, pages 230-240, 1991. (abstract)
  31. R.R. Weber and G. Weiss. Addendum to `On an index policy for restless bandits'. J. Appl. Prob. 23, 429-430, 1991. (abstract)
  32. C-S Chang, X. Chao, M. Pinedo and R.R. Weber. On the optimality of LEPT and cu rules for machines in parallel.J. Appl. Prob. 24, 667-681, 1992. (abstract)
  33. R.R. Weber. The interchangeability of tandem queues with heterogeneous customers and dependent service times. J. Appl. Prob. 24, 727-737, 1992. (abstract)
  34. R.R. Weber. On the Gittins index for multiarmed bandits. Ann. Appl. Prob. 2, 1024-33, 1992. (abstract)
  35. E.G. Coffman, Jr, D.S. Johnson, P.W. Shor and R.R. Weber. Markov chains, computer proofs, and average-case analysis of best fit bin packing. In Proc. 25 Annual ACM Symposium on Theory of Computing, San Diego, May, pages 412-421, 1993.
  36. R.R. Weber. On a conjecture about assigning jobs to processors of different speeds. IEEE Trans. Auto. Control 38, 166-169, 1993. (abstract)
  37. S. Stidham and R. Weber. A survey of Markov decision models for control of networks of queues. Queueing Systems 13, 291-314, 1993. (abstract)
  38. C. Courcoubetis, G. Fouskas and R.R. Weber. On the performance of an effective bandwidths formula. in Jaques Labetoulle and James W. Roberts, editors, The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, Proceedings of the 14th International Teletraffic Congress --- ITC 14, volume 1a of Teletraffic Science and Engineering, 201-212, Elsevier Science, B.V., 1994, Antibes Juan-les-Pins. (abstract)
  39. R.R. Weber and G. Weiss. The cafeteria process, tandem queues with dependent 0-1 service times and the bowl shape phenomenon. Operations Research 42, 895-912, 1994. (abstract)
  40. C. Courcoubetis and R.R. Weber. Stability of flexible manufacturing systems. Operations Research 42, 947-957, 1994. (abstract)
  41. R.R. Weber. Stochastic analysis of intelligent switching. BT Technology Journal, 12, 63-66, 1994. (abstract)
  42. R.R. Weber. Large deviations and fluid approximations in control of stochastic systems. In F.P. Kelly, editor, Probability Statistics and Optimization, a Tribute to Peter Whittle, pages 159-171. Wiley, 1994. (abstract)
  43. C. Courcoubetis, G. Kesidis, A. Ridder, J. Walrand and R.R. Weber. Admission control and routing in ATM networks using inferences from measured buffer occupancy. (ORSA/TIMS special interest meeting, Monterey, January, 1991, and) IEEE Transactions on Communications 43, 1778-1784, 1995. (abstract)
  44. C. Courcoubetis and R.R. Weber. Effective bandwidths for stationary sources. Probability in the Engineering and Information Sciences, 9, 285-296, 1995. (abstract)
  45. C. Courcoubetis, G. Fouskas and R. R. Weber. A on-line estimation procedure for cell-loss probabilities in ATM links. In Proceedings of the 3rd IFIP Workshop on Performance Modelling and Evaluation of ATM Networks, July, 1995. (abstract)
  46. R.R. Weber. Scheduling and interchangeability in tandem queues. In P. Chretienne, E.G. Coffman Jr, J.K. Lenstra Z. and Liu, editors, Scheduling Theory and its Application, volume 15, pages 314-325, 1995, John Wiley & Sons. (abstract)
  47. R.R. Weber. Intelligent Switching. In P. Cochrane and D.J.T Heatley, editors, Modelling Future Telecommunications Systems, BT Telecommunications Series, volume 7, chapter 9, pages 144-152, 1996, John Wiley & Sons.
  48. C. Courcoubetis and R.R. Weber. Buffer overflow asymptotics for a switch handling many traffic sources. J. Appl. Prob., 33, 886-903, 1996. (abstract) (postscript file)
  49. E.G. Coffman, Jr, D.S. Johnson, Shor and R.R. Weber. Bin packing with discrete item sizes, Part II: tight bounds on first fit. Random Structures and Algorithms, 10, 69-101, 1996. (abstract)
  50. C. Courcoubetis, V. A. Siris and R. Weber. Investigation of cell scale and burst scale effects on the cell loss probability using large deviations. In Proceedings of 15th U.K. Workshop on Performance Engineering of Computer and Telecommunication Systems (UKPEW'97) , Ilkley, U.K., July 24, 1997. (abstract)
  51. C. Courcoubetis, F.P. Kelly, V.A. Siris, G.D. Stamoulis and R. Weber. ABR pricing experiments in a real network. In Proceedings of International Conference on Telecommunications (ICT'97), Melbourne, Australia, April 1997. (abstract)
  52. E.G. Coffman, Z. Lui and R.R. Weber. Optimal robot scheduling for web search engines, Journal of Scheduling 1, 15-29, 1998. (abstract)
  53. C. Courcoubetis, F.P. Kelly, V.A. Siris and R.R. Weber. A study of simple usage-based charging schemes for broadband networks, In IFIP TC6 International Conference on Broadband Communications, Stuttgart, Germany, April, 1998. (abstract)
  54. S. Stidham and R.R. Weber. Monotone optimal policies for left-skip-free Markov decision processes, in Applied Probability and Stochastic Processes, Kluwer Academic Publishers, J. George Shanthikumar and Ushio Sumita eds, 13, 191-202, 1999. (abstract)
  55. C.A. Glass, C.N. Potts, V.A. Struesevitch and R.R. Weber. Models and Algorithms for Planning and Scheduling Problems: Cambridge Workshop, editors of Special Issue of Annals of Operations Research, 1999.
  56. J. Csirik, D.S. Johnson, C. Kenyon, P.W. Shor and R.R. Weber. A self-organizing bin packing heuristic, in Proceedings 1999 Workshop on Algorithmic Engineering and Experimentation, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1619, 246-265, 1999. (abstract)
  57. C. Courcoubetis, F.P. Kelly and R.R. Weber. Measurement based charging in communication networks, Operations Research, 48(4), 535-548, 2000. (abstract)
  58. E.G. Coffman, C. Courcoubetis, D.S. Johnson, M.R. Garey, P.W. Shor, R.R. Weber and M. Yannikakis. Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings, SIAM J. Discrete Math, 13, 384-402, 2000. (abstract)
  59. C. Courcoubetis, F.P. Kelly, V.A. Siris and R.R. Weber. A study of simple charging schemes for broadband networks, Telecommunication Systems, 15, 323-343, 2000. (abstract)
  60. J. Csirik, D.S. Johnson, C. Kenyon, J.B. Orlin, P.W. Shor and R.R. Weber. On the sum-of-squares algorithm for bin packing, In Proc. 32nd Annual ACM Symp. on Theory of Computing, pages 208213. ACM, New York, 2000. (abstract) 
  61. E. G. Coffman, C. Courcoubetis, D. S. Johnson, M. R. Garey, P. W. Shor, R. R. Weber, and M. Yannikakis. Perfect packing theorems and the average case behavior of optimal and online bin packing. SIAM Review, 44:95108, 2002.
  62. C. Courcoubetis and R. R. Weber. Asymptotics for provisioning problems of peering wireless LANS with a large number of participants. In Proceedings of WiOpt04: Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks, March 2004.
  63. J Csirik, D. S. Johnson, C. Kenyon, J. B. Orlin, P. W. Shor, and R. R. Weber. On the sum-of-squares algorithm for bin packing.JACM, 1, 53,1-85, 2006. (preprint at http://arxiv.org/abs/cs/0210013)
  64. C. Courcoubetis and R. R. Weber. Incentives for large peer-to-peer systems. IEEE Journal on Selected Areas in Communications, 24(5):10341049, May 2006.
  65. C. Courcoubetis, S.Soursos,and R. R.Weber. Pricing resources on demand. In 1st IEEE International Workshop on Bandwidth on Demand, 1218,2006.
  66. R.R. Weber, Comments on: Dynamic priority allocation via restless bandit marginal productivity indices (by Jose Nino-Mora),  TOP, 15(2), , 211-216, 2007.
  67. J.Mundinger and R. R.Weber. Scheduling of peer-to-peer file dissemination. Journal of Scheduling,11(2), 105-220, 2008. (preprint at  http://arxiv.org/abs/cs/0606110).
  68. R.R. Weber, The optimal strategy for rendezvous search on K3, 2006, http://arxiv.org/abs/0906.5447v1 [math,OC]
  69. S. Soursos, C. Coucoubetis, and R. R. Weber. Dynamic bandwidth pricing: Provision cost market size, effective bandwidths and price games.  Journal of Universal Computer Science, 14(5), 766--785, 2008 (paper) 
  70. R.R. Weber, The Simples Algorithm. In "The Princeton Companion to Mathematics"  (Editor Timothy Gowers; June Barrow-Green and Imre Leader, associate editors) Princeton University Press 2008.
  71. C. Courcoubetis and R.R. Weber. Economic issues in shared infrastructures, VISA Workshop, Barcelona, Spain, August 2009, ACM.
  72. C. Courcoubetis, C. Kalogiros and R.R. Weber, Optimal call routing in VoIP, ITC 21, Paris, September 2009.
  73. R.R. Weber. Multi-armed bandit problem and Gittins index, in Wiley Encyclopedia of Operations Research and Management Science, 2011.
  74. J.C. Giittins, K.D. Glazebrook, and R.R. Weber. Multiarmed Bandit Allocation Indices, (2nd editon)", Wiley, 2011. 

    In Press

    Accepted for publication
  75. R.R. Weber, The optimal strategy for rendezvous search on K3, accepted for publication in Maths of OR.
  76. C. Courcoubetis and R.R. Weber, Economic issues in shared infrastructures, accepted for publicationin Transactions on Networking..





    Working Papers

homehome page