scispace - formally typeset
M

Madhuchanda Paul

Researcher at Gauhati University

Publications -  5
Citations -  190

Madhuchanda Paul is an academic researcher from Gauhati University. The author has contributed to research in topics: M/G/1 queue & Queue. The author has an hindex of 5, co-authored 5 publications receiving 188 citations.

Papers
More filters
Journal ArticleDOI

Steady state analysis of an Mx/G/1 queue with two phase service and Bernoulli vacation schedule under multiple vacation policy

TL;DR: An extensive stationary analysis of the batch arrival queue system, including existence of stationary regime, queue size distribution of idle period process, embedded Markov chain steady state distribution of stationary queue size, busy period distribution along with some system characteristics is carried out.
Journal ArticleDOI

A Batch Arrival Queue with a Second Optional Service Channel Under N-Policy

TL;DR: In this paper, the authors considered an M X /G/1 queueing system with a second optional service channel under N-policy and derived a simple procedure to obtain optimal stationary policy under a suitable linear cost structure.
Journal Article

A two phase queueing system with Bernoulli feedback

TL;DR: The queue size distribution at random epoch and at a service completion epoch is derived and the distribution of response time and busy period is derived.
Journal ArticleDOI

A batch arrival queue with an additional service channel under N-policy

TL;DR: An M^x/G/1 queueing system with two phases of heterogeneous service under N-policy, where the server remains idle till the queue size becomes N(>=1).
Journal ArticleDOI

A two phases queueing system with Bernoulli vacation schedule under multiple vacation policy

TL;DR: In this paper, a single server Poisson arrival queue with two phases of heterogeneous service along with a Bernoulli schedule vacation model is considered, where after two successive phases service the server either goes for a vacation with probability p ( 0 ≤ p ≤ 1 ) or may continue to serve the next unit, if any, with probability q ( = 1 − p ).