skip to content

Department of Pure Mathematics and Mathematical Statistics

Professor of Mathematics for Operational Research

Research Interests: Mathematics for operational research and systems, models in telecommunications and operations management, control of queues, stochastic networks, on-line bin-packing, ergodicity of markov processes, optimal search, stochastic scheduling, dynamic resource allocation, financial mathematics

Publications

Front Matter
E Scholz, G Maynard
– Archaeological Review from Cambridge
(2021)
36,
2
Necessary and sufficient conditions for stability of a bin-packing system
C COURCOUBETIS, RR WEBER
– Journal of Applied Probability
(2016)
23,
989
The rendezvous problem on discrete locations
EJ ANDERSON, RR WEBER
– Journal of Applied Probability
(2016)
27,
839
Optimal search for a randomly moving object
RR WEBER
– Journal of Applied Probability
(2016)
23,
708
On the optimal assignment of customers to parallel servers
RR WEBER
– Journal of Applied Probability
(2016)
15,
406
On the optimality of LEPT and cµ rules for machines in parallel
CS CHANG, XL CHAO, M PINEDO, R WEBER
– Journal of Applied Probability
(2016)
29,
667
Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
RR WEBER, P VARAIYA, J WALRAND
– Journal of Applied Probability
(2016)
23,
841
INTERCHANGEABILITY OF [M]1 QUEUES IN SERIES
RR WEBER
– Journal of Applied Probability
(2016)
16,
690
Buffer overflow asymptotics for a buffer handling many traffic sources
C Courcoubetis, R Weber
– Journal of Applied Probability
(2016)
33,
886
A counterexample to a conjecture on optimal list ordering
EJ ANDERSON, P NASH, RR WEBER
– Journal of Applied Probability
(2016)
19,
730
  • 1 of 8
  • >