V. C. Joshua

V. C. Joshua
CMS College Kottayam · Department of Mathematics

About

26
Publications
1,727
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
283
Citations

Publications

Publications (26)
Chapter
We consider a two server queueing inventory model with two types of customers. Type-I customers can form an infinite queue, while type-II customers join a finite buffer of size N. There are two servers. Server-1 is a dedicated server, giving service only to the type-I customers. Server-2 provides service to both type-I and type-II customers. Servic...
Chapter
The queueing system considered consist of two multi-server stations in series. Customers arrive according to a Markovian Arrival Process to an infinite capacity queue at the first station. There are c servers who provide identical exponentially distributed service at the first station. A customer at the head of the queue can enter into service if a...
Article
In the considered queueing system, the service is provided at two stations, station 1 and station 2 operating in tandem. Station 1 is a multi-server station with c identical servers working in parallel, and station 2 is equipped with a single server called the specialist server. The service times of each of the servers at station 1 follow an expone...
Book
This book gathers selected papers presented at the International Conference on Advances in Applied Probability and Stochastic Processes, held at CMS College, Kerala, India, on 7–10 January 2019. It showcases high-quality research conducted in the field of applied probability and stochastic processes by focusing on techniques for the modelling and a...
Chapter
In this paper, we consider a queueing inventory model. Customers arriving to a single server queueing system in which, server uses some commodities from the inventory to fulfill the service. Service of a customer is initiated only when the server is free and the commodities for the service are available in the inventory. Otherwise, the arriving cus...
Chapter
We consider a queueing inventory model with positive service time and two service channels. Channel I is a single server facility and channel II is a bulk service facility. There are two types of customers, type-I and type-II. The same type of commodity is served to both types of customers. Channel I provides service to type-I customers and channel...
Chapter
We consider a single server retrial queueing system with parallel queues of ordinary and priority customers. Priority customers join the queues according to a probabilistic joining strategy until the ordinary queue is full. We also assume that there is a waiting room for the blocked ordinary customers and they make retrials from there, to enter int...
Chapter
We propose an efficient model of an epidemic management system with the notion of “self generation of status” and random clock for the quarantine period of a ‘suspected’ person (we designate them as ‘customers’). Customers arrive for check up according to a Markovian arrival process. They enter into a multi server station; assume that the chance of...
Chapter
We consider a tandem queueing network with two service stations without buffers. An infinite capacity station named as the main station provides usual paid service. Another station is a finite capacity station named as the offer zone. The offer zone is an intermediate station strategically designed to attract the maximum number of customers to the...
Chapter
In the current study we analyze a queueing inventory system with a special reference to the allocation of organs for transplantation. The model is composed of an inventory of organs and queue of patients who wait for transplantation. The model captures the unexpected arrival of organs and their highly perishable nature. Reneging of patients due to...
Chapter
We consider a multistage single server queueing model with one infinite queue and two finite buffers. The primary customer on arrival joins an infinite queue. The head of the queue finding an idle server, enter into Stage I of service. A customer who found fit, pass on to Stage II with probability p, \(0\le p\le 1\) and those who found unfit pass o...
Conference Paper
A single server retrial queueing model, in which customers arrive according to a batch Markovian arrival process (BMAP), is considered. An arriving batch, finding server busy, enters an orbit. Otherwise one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit try to reach the se...
Conference Paper
We consider a single server queueing model with two parallel queues in which one is finite buffer and the other is infinite. Customers arrive according to two independent Poisson processes and service time follows phase type distribution. Customers receive service on the basis of a token system. Customers in the infinite queue are ordinary customer...
Conference Paper
We consider a single server retrial queueing model with two types of customers, abandonment of customers and search for priority customers. Two types of customers namely type I and type II arrive according to two independent Poisson processes and upon arrival, if the server is busy, join orbits I and II respectively. Orbit I is of finite capacity w...
Conference Paper
Full-text available
Emergency messages originating on the highways need quick transmission, lest they loose significance. However, highways are not equipped with much Road side units (RSU) nor enough of on board units. Thus several emergency messages do not reach the destination in time which result in accidents and other untoward incidents. In this paper we propose m...
Article
Single server retrial queueing models in which customers arrive according to a batch Poisson process are considered here. An arriving batch, finding the server busy, enters an orbit. Otherwise, one customer from the arriving batch enters for service immediately while the rest join the orbit. The customers from the orbit (the orbital customers) try...
Article
We consider a multi-server retrial queueing model in which customers arrive according to a Markovian arrival process (MAP). An arriving customer finding a free server enters into service immediately; otherwise the customer enters into an orbit of infinite size. An orbiting customer competes for service by sending out signals at random times until a...
Article
The M|G|1 retrial queue with nonpersistent customers and orbital search is considered. If the server is busy at the time of arrival of a primary customer, then with probability 1 − H1 it leaves the system without service, and with probability H1 > 0, it enters into an orbit. Similarly, if the server is occupied at the time of arrival of an orbital...
Article
We consider a single server retrial queuing model in which customers arrive according to a batch Markovian arrival process. Any arriving batch finding the server busy enters into an orbit. Otherwise one customer from the arriving batch enters into service immediately while the rest join the orbit. The customers from the orbit try to reach the servi...
Article
A queueing system in which work gets postponed due to finiteness of the buffer is considered. When the buffer is full (capacity K) further arrivals are directed to a pool of customers (postponed work). An arrival encountering the buffer full, will join the pool with probability γ (0<γ<1); else it is lost to the system forever. When, at a departure...
Article
Queueing system in which arriving customers who find all servers and waiting positions (if any) occupied many retry for service after a period of time are retrial queues or queues with repeated attempts. This study deals with two objectives one is to introduce orbital search in retrial queueing models which allows to minimize the idle time of the s...

Network

Cited By

Projects

Project (1)