IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v2y1974i1p85-113.html
   My bibliography  Save this article

Stochastic clearing systems

Author

Listed:
  • Stidham, Shaler

Abstract

A stochastic clearing system is characterized by a non-decreasing stochastic input process {Y(t), t [greater, double equals] 0}, where Y(t) is the cumulative quantity entering the system in [0, t], and an output mechanism that intermittently and instantaneously clears the system, that is, removes all the quantity currently present. Examples may be found in the theory of queues, inventories, and other stochastic service and storage systems. In this paper we derive an explicit expression for the stationary (in some cases, limiting) distribution of the quantity in the system, under the assumption that the clearing instants are regeneration points and, in particular, first entrance times into sets of the form {y: y>q}. The expression is in terms of the sojourn measure W associated with {Y(t), t [greater, double equals] 0}: W{A} = E{time spent in A by Y(t), 0

Suggested Citation

  • Stidham, Shaler, 1974. "Stochastic clearing systems," Stochastic Processes and their Applications, Elsevier, vol. 2(1), pages 85-113, January.
    • Handle: RePEc:eee:spapps:v:2:y:1974:i:1:p:85-113
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(74)90014-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Qi‐Ming He & James H. Bookbinder & Qishu Cai, 2020. "Optimal policies for stochastic clearing systems with time‐dependent delay penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 487-502, October.
    2. Bu, Qihui & Sun, Yun & Chai, Xudong & Liu, Liwei, 2020. "Strategic behavior and social optimization in a clearing queueing system with N-policy and stochastic restarting scheme," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    3. Dimitrios Logothetis & Antonis Economou, 2023. "The impact of information on transportation systems with strategic customers," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2189-2206, July.
    4. Berg, M. & van der Duyn Schouten, F.A. & Jansen, J.B., 1996. "Optimal Service Policies to Remote Customers with Delay-Limits," Other publications TiSEM 94a53598-1da9-4f29-a91d-a, Tilburg University, School of Economics and Management.
    5. Konovalov, Mikhail & Razumchik, Rostislav, 2023. "Finite capacity single-server queue with Poisson input, general service and delayed renovation," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1075-1083.
    6. Canbolat, Pelin G., 2020. "Bounded rationality in clearing service systems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 614-626.
    7. Germs, Remco & Van Foreest, Nicky D. & Kilic, Onur A., 2016. "Optimal policies for production-clearing systems under continuous-review," European Journal of Operational Research, Elsevier, vol. 255(3), pages 747-757.
    8. Berg, M. & van der Duyn Schouten, F.A. & Jansen, J.B., 1996. "Optimal Service Policies to Remote Customers with Delay-Limits," Discussion Paper 1996-37, Tilburg University, Center for Economic Research.
    9. Antonis Economou & Athanasia Manou, 2013. "Equilibrium balking strategies for a clearing queueing system in alternating environment," Annals of Operations Research, Springer, vol. 208(1), pages 489-514, September.
    10. Jansen, J.B., 1998. "Service and inventory models subject to a delay-limit," Other publications TiSEM d51b1fee-e8a2-46bc-b331-1, Tilburg University, School of Economics and Management.
    11. David Perry & Wolfgang Stadje & Shelemyahu Zacks, 2005. "Sporadic and Continuous Clearing Policies for a Production/Inventory System Under an M / G Demand Process," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 354-368, May.
    12. Oded Berman & Mahmut Parlar & David Perry & M. J. M. Posner, 2005. "Production/Clearing Models Under Continuous and Sporadic Reviews," Methodology and Computing in Applied Probability, Springer, vol. 7(2), pages 203-224, June.
    13. Royi Jacobovic & Offer Kella, 2019. "Asymptotic independence of regenerative processes with a special dependence structure," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 139-152, October.
    14. Banu Yüksel Özkaya & Ülkü Gürler & Emre Berk, 2006. "The stochastic joint replenishment problem: A new policy, analysis, and insights," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 525-546, September.
    15. Menachem Berg & Frank van der Duyn Schouten & Jorg Jansen, 1998. "Optimal Batch Provisioning to Customers Subject to a Delay-Limit," Management Science, INFORMS, vol. 44(5), pages 684-697, May.

    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:eee:spapps:v:2:y:1974:i:1:p:85-113. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.