IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v70y2009i1p77-98.html
   My bibliography  Save this article

Transient solution of a non-empty chemical queueing system

Author

Listed:
  • Ahmed Tarabia
  • Hideaki Takagi
  • A.H. El-Baz

Abstract

In this paper, we illustrate that a power series technique can be used to derive explicit expressions for the transient state distribution of a queueing problem having “chemical” rules with an arbitrary number of customers present initially in the system. Based on generating function and Laplace techniques Conolly et al. (in Math Sci 22:83–91, 1997) have obtained the distributions for a non-empty chemical queue. Their solution enables us only to recover the idle probability of the system in explicit form. Here, we extend not only the model of Conolly et al. but also get a new and simple solution for this model. The derived formula for the transient state is free of Bessel function or any integral forms. The transient solution of the standard M/M/1/∞ queue with λ = μ is a special case of our result. Furthermore, the probability density function of the virtual waiting time in a chemical queue is studied. Finally, the theory is underpinned by numerical results. Copyright Springer-Verlag 2009

Suggested Citation

  • Ahmed Tarabia & Hideaki Takagi & A.H. El-Baz, 2009. "Transient solution of a non-empty chemical queueing system," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(1), pages 77-98, August.
  • Handle: RePEc:spr:mathme:v:70:y:2009:i:1:p:77-98
    DOI: 10.1007/s00186-008-0232-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-008-0232-y
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s00186-008-0232-y?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
    ---><---

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

    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:spr:mathme:v:70:y:2009:i:1:p:77-98. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.