IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v10y1962i6p839-892.html
   My bibliography  Save this article

Reducing Letter Delays in Post Offices

Author

Listed:
  • Robert M. Oliver

    (University of California, Berkeley)

  • Aryeh H. Samuel

    (Stanford Research Institute, Menlo Park, California)

Abstract

This paper reports a number of mathematical models and experiments that have been designed for the analysis and evaluation of delays of first-class letter mail in a post office. The flow pattern of mail consists of a number of serial and parallel processing stages. A letter takes a particular path through this flow network, which depends on its final destination, consequently, the delay of letter mail depends on its address as well as the inventories of other mail and the processing rates met enroute. While mail flow into a post office may contain many random elements, it is generally the case that input rates are predictable and strongly time-dependent. Scheduling policies must take into account the peak flows that temporarily exceed available processing rates and, in addition, must observe certain specified restrictions on the cost of processing, sorting, and storage operations. The effect of various transportation facilities between processing stages and from one post office to another must also be considered. The mathematical analysis deals with the minimization of letter delay through a network of processing and storage stages where there are capacity restrictions on individual and/or serial and parallel stage combinations. Analytical and graphical procedures are developed and numerical results are reported. The paper also reports a series of full-scale experiments performed at one of the larger United States Post Offices where theoretical procedures and decision rules were applied and tested. Delay reductions for first-class letter mail are believed to be of the order of 25 per cent.

Suggested Citation

  • Robert M. Oliver & Aryeh H. Samuel, 1962. "Reducing Letter Delays in Post Offices," Operations Research, INFORMS, vol. 10(6), pages 839-892, December.
    • Handle: RePEc:inm:oropre:v:10:y:1962:i:6:p:839-892
    DOI: 10.1287/opre.10.6.839
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.10.6.839
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.10.6.839?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    2. Noa Zychlinski & Avishai Mandelbaum & Petar Momčilović, 2018. "Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 15-47, June.
    3. Linda V. Green & Peter J. Kolesar, 1998. "A Note on Approximating Peak Congestion in Mt/G/\infty Queues with Sinusoidal Arrivals," Management Science, INFORMS, vol. 44(11-Part-2), pages 137-144, November.
    4. Wang, Haiyan & Olsen, Tava Lennon & Liu, Guiqing, 2018. "Service capacity competition with peak arrivals and delay sensitive customers," Omega, Elsevier, vol. 77(C), pages 80-95.
    5. Wei-Hua Lin & Hong K. Lo, 2009. "Investigating Braess' Paradox with Time-Dependent Queues," Transportation Science, INFORMS, vol. 43(1), pages 117-126, February.
    6. Ward Whitt & Wei You, 2019. "Time-Varying Robust Queueing," Operations Research, INFORMS, vol. 67(6), pages 1766-1782, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:10:y:1962:i:6:p:839-892. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.