Analysis of a k -Stage Bulk Service Queuing System with Accessible Batches for Service

Achyutha Krishnamoorthy, Anu Nuthan Joshua and Vladimir Vishnevsky
Additional contact information
Achyutha Krishnamoorthy: Centre for Research in Mathematics, CMS College, Kottayam 686001, India
Anu Nuthan Joshua: Department of Mathematics, Union Christian College, Aluva 683102, India
Vladimir Vishnevsky: V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, 65 Profsoyuznaya Street, 117997 Moscow, Russia

Mathematics, 2021, vol. 9, issue 5, 1-16

Abstract: In most of the service systems considered so far in queuing theory, no fresh customer is admitted to a batch undergoing service when the number in the batch is less than a threshold. However, a few researchers considered the case of customers accessing ongoing service batch, irrespective of how long service was provided to that batch. A queuing system with a different kind of accessibility that relates to a real situation is studied in the paper. Consider a single server queuing system in which the service process comprises of k stages. Customers can enter the system for service from a node at the beginning of any of these stages (provided the pre-determined maximum service batch size is not reached) but cannot leave the system after completion of service in any of the intermediate stages. The customer arrivals to the first node occur according to a Markovian Arrival Process ( M A P ) . An infinite waiting room is provided at this node. At all other nodes, with finite waiting rooms (waiting capacity c j , 2 ? j ? k ), customer arrivals occur according to distinct Poisson processes with rates ? j , 2 ? j ? k . The service is provided according to a general bulk service rule, i.e., the service process is initiated only if at least a customers are present in the queue at node 1 and the maximum service batch size is b . Customers can join for service from any of the subsequent nodes, provided the number undergoing service is less than b . The service time distribution in each phase is exponential with service rate ? j m , which depends on the service stage j , 1 ? j ? k , and the size of the batch m , a ? m ? b . The behavior of the system in steady-state is analyzed and some important system characteristics are derived. A numerical example is presented to illustrate the applicability of the results obtained.

Keywords: queuing system; Markovian arrival process; accessible service batches; transport systems (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/5/559/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/5/559/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:5:p:559-:d:511686

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().