This paper develops two stochastic models of an internal mail delivery system in which a single clerk picks up, sorts and delivers mail to a closed loop of offices. The two models differ in whether deliveries are made at scheduled times or not. For a model in which all mail picked up each round is sorted before the next delivery, we assume that mail is generated in the system by a stationary Poisson process and derive an expression for the expected delay between generation of a letter and its ultimate delivery. These results are then extended to systems in which letters are generated according to a stationary compound Poisson process and to multiple clerk delivery systems.
A second model in which mail is delivered at scheduled times only is shown to be equivalent to a classical storage process. For this model, we derive bounds on the expected number of letters left unsorted at the start of a scheduled delivery and the expected delivery delay. This model is also generalized to multiclerk systems.
[1]
Robert M. Oliver,et al.
REDUCING LETTER DELAYS IN POST OFFICES
,
1962
.
[2]
Robert B. Cooper,et al.
An Introduction To Queueing Theory
,
2016
.
[3]
P. J. Burke.
Technical Note - Delays in Single-Server Queues with Batch Input
,
1975,
Oper. Res..
[4]
William Feller,et al.
An Introduction to Probability Theory and Its Applications
,
1967
.
[5]
K. M. Jasinski,et al.
Modelling letter delivery in town areas
,
1977,
Comput. Oper. Res..
[6]
G. F. Newell,et al.
Introduction to the Theory of Queues.
,
1963
.
[7]
Jatinder N. D. Gupta,et al.
Operations research in postal services - a survey
,
1977,
Comput. Oper. Res..
[8]
Norman T. J. Bailey,et al.
On Queueing Processes with Bulk Service
,
1954
.