IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i10p2280-d1146260.html
   My bibliography  Save this article

On Queues with Working Vacation and Interdependence in Arrival and Service Processes

Author

Listed:
  • S Sindhu

    (Department of Mathematics, Model Engineering College, Ernakulam 682021, India
    Department of Mathematics, Cochin University of Science and Technology, Ernakulam 682022, India)

  • Achyutha Krishnamoorthy

    (Centre for Research in Mathematics, CMS College, Kottayam 686001, India
    Department of Mathematics, Central University of Kerala, Kasargod 671316, India)

  • Dmitry Kozyrev

    (V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, 65 Profsoyuznaya Street, 117997 Moscow, Russia
    Applied Probability and Informatics Department, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, 117198 Moscow, Russia)

Abstract

In this paper, we consider two queuing models. Model 1 considers a single-server working vacation queuing system with interdependent arrival and service processes. The arrival and service processes evolve by transitions on the product space of two Markovian chains. The transitions in the two Markov chains in the product space are governed by a semi-Markov rule, with sojourn times in states governed by the exponential distribution. In contrast, in the second model, we consider independent arrival and service processes following phase-type distributions with representation ( α , T ) of order m and ( β , S ) of order n, respectively. The service time during normal working is the above indicated phase-type distribution whereas that during working vacation is a phase-type distribution with representation ( β , θ S ) , 0 < θ < 1 . The duration of the latter is exponentially distributed. The latter model is already present in the literature and will be briefly described. The main objective is to make a theoretical comparison between the two. Numerical illustrations for the first model are provided.

Suggested Citation

  • S Sindhu & Achyutha Krishnamoorthy & Dmitry Kozyrev, 2023. "On Queues with Working Vacation and Interdependence in Arrival and Service Processes," Mathematics, MDPI, vol. 11(10), pages 1-16, May.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:10:p:2280-:d:1146260
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/10/2280/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/10/2280/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Boxma, O. J. & Perry, D., 2001. "A queueing model with dependence between service and interarrival times," European Journal of Operational Research, Elsevier, vol. 128(3), pages 611-624, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Sindhu S & Achyutha Krishnamoorthy & Dmitry Kozyrev, 2023. "A Two-Server Queue with Interdependence between Arrival and Service Processes," Mathematics, MDPI, vol. 11(22), pages 1-25, November.
    2. Gabi Hanukov & Uri Yechiali, 2024. "Orbit while in service," Operational Research, Springer, vol. 24(2), pages 1-32, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wu, Kan & Zhao, Ning, 2015. "Dependence among single stations in series and its applications in productivity improvement," European Journal of Operational Research, Elsevier, vol. 247(1), pages 245-258.
    2. Albrecher, Hansjorg & Boxma, Onno J., 2004. "A ruin model with dependence between claim sizes and claim intervals," Insurance: Mathematics and Economics, Elsevier, vol. 35(2), pages 245-254, October.
    3. O. J. Boxma & M. R. H. Mandjes, 2022. "Queueing and risk models with dependencies," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 69-86, October.
    4. Vlasiou, M. & Adan, I.J.B.F. & Boxma, O.J., 2009. "A two-station queue with dependent preparation and service times," European Journal of Operational Research, Elsevier, vol. 195(1), pages 104-116, May.
    5. Peter Buchholz & Jan Kriege, 2017. "Fitting correlated arrival and service times and related queueing performance," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 337-359, April.
    6. Sindhu S & Achyutha Krishnamoorthy & Dmitry Kozyrev, 2023. "A Two-Server Queue with Interdependence between Arrival and Service Processes," Mathematics, MDPI, vol. 11(22), pages 1-25, November.

    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:gam:jmathe:v:11:y:2023:i:10:p:2280-:d:1146260. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.