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

Semi-stationary clearing processes

Author

Listed:
  • Serfozo, Richard
  • Stidham, Shaler

Abstract

A clearing process describes the net quantity in a service system (e.g. a batch service queue or dam) which receives an exogenous random input over time. and has an output mechanism that intermittently clears random quantities from the system. A semistationary clearing process is strictly stationary over its random clearing epochs. We describe the asymptotic distribution of such processes and show how it arises in limits of certain functionals of these processes. An asymptotic distribution is different from a limiting distribution, but it has some similar properties. We then identify some clearing processes whose asymptotic distribution is uniform. This is true for modulo c clearing with a stationary input if the Palm probability is used rather than the usual probability. Our results on this give a partial answer to an anomaly in the classical economic lot size inventory model. We also present a functional central limit law and law of the iterated logorithm for clearing processes, as well as a result on the convergence of a sequence of such processes.

Suggested Citation

  • Serfozo, Richard & Stidham, Shaler, 1978. "Semi-stationary clearing processes," Stochastic Processes and their Applications, Elsevier, vol. 6(2), pages 165-178, January.
    • Handle: RePEc:eee:spapps:v:6:y:1978:i:2:p:165-178
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(78)90058-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. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    2. Charles J. Corbett, 2001. "Stochastic Inventory Systems in a Supply Chain with Asymmetric Information: Cycle Stocks, Safety Stocks, and Consignment Stock," Operations Research, INFORMS, vol. 49(4), pages 487-500, August.
    3. Ang, Marcus & Song, Jing-Sheng & Wang, Mingzheng & Zhang, Hanqin, 2013. "On properties of discrete (r, q) and (s, T) inventory systems," European Journal of Operational Research, Elsevier, vol. 229(1), pages 95-105.
    4. Wang, Jinting & Liu, Bin & Li, Jianghua, 2008. "Transient analysis of an M/G/1 retrial queue subject to disasters and server failures," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1118-1132, September.
    5. Perry, David & Stadje, Wolfgang, 2000. "Risk analysis for a stochastic cash management model with two types of customers," Insurance: Mathematics and Economics, Elsevier, vol. 26(1), pages 25-36, February.
    6. Uday S. Rao, 2003. "Properties of the Periodic Review (R, T) Inventory Control Policy for Stationary, Stochastic Demand," Manufacturing & Service Operations Management, INFORMS, vol. 5(1), pages 37-53, February.
    7. P. Escalona & F. Ordóñez & I. Kauak, 2017. "Critical level rationing in inventory systems with continuously distributed demand," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 273-301, January.
    8. Feray Tunçalp & Lerzan Örmeci & Evrim D. Güneş, 2024. "Capacity allocation in a two-channel service system from a social planner’s perspective," Queueing Systems: Theory and Applications, Springer, vol. 108(1), pages 185-213, October.
    9. Lagodimos, A.G. & Christou, I.T. & Skouri, K., 2012. "Computing globally optimal (s,S,T) inventory policies," Omega, Elsevier, vol. 40(5), pages 660-671.
    10. Hongtao Zhang, 1998. "A Note on the Convexity of Service-Level Measures of the (r, q) System," Management Science, INFORMS, vol. 44(3), pages 431-432, March.
    11. 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.
    12. Barron, Yonit, 2016. "Clearing control policies for MAP inventory process with lost sales," European Journal of Operational Research, Elsevier, vol. 251(2), pages 495-508.
    13. 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.
    14. 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.
    15. Metin Çakanyildirim & Sirong Luo, 2017. "Stochastic inventory system with lead time flexibility: offered by a manufacturer/transporter," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1533-1552, December.

    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:6:y:1978:i:2:p:165-178. 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.