2025/01/15 by Rohini Bhagwanrao Pote, Pote, R. B., K. K. Kataria +1 · 2 citations
Decision Sciences · Engineering · #26A33 #60K20 #Advanced Manufacturing and Logistics Optimization #FOS: Mathematics #Primary: 60K15 #Probability (math.PR) #Scheduling and Optimization Algorithms #Scheduling and Timetabling Solutions #Secondary: 60K25
paper · pdf · doi:10.48550/arxiv.2501.08789
openalex publication_date 2025/01/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce and study a queue with the Erlang service system and whose arrivals are governed by a counting process in which there is a possibility of finitely many arrivals in an infinitesimal time interval. We call it the Erlang queue with multiple arrivals. Some of its distributional properties are obtained that includes the state-phase probabilities, the mean queue length and the distribution of busy period etc. Also, we study a time-changed variant of it by subordinating it with an independent inverse stable subordinator where we obtain its state probabilities and the mean queue length.