scispace - formally typeset
S

S. K. Samanta

Researcher at National Institute of Technology, Raipur

Publications -  52
Citations -  418

S. K. Samanta is an academic researcher from National Institute of Technology, Raipur. The author has contributed to research in topics: Queueing theory & Queue. The author has an hindex of 13, co-authored 49 publications receiving 380 citations. Previous affiliations of S. K. Samanta include University of Avignon & Technical University of Lisbon.

Papers
More filters
Journal ArticleDOI

Discrete-time bulk-service queues with accessible and non-accessible batches

TL;DR: This paper analyzes a discrete-time single-server infinite- (finite-) buffer bulk-service queues that serves customers in accessible or non-accessible batches in independent and geometrically distributed fashion.
Journal ArticleDOI

Discrete-time GeoX/G(a,b)/1/N queues with single and multiple vacations

TL;DR: This paper considers a discrete-time single-server finite-buffer batch arrival queue in which customers are served in batches according to a general bulk-service rule, that is, at least 'a' customers are needed to start a service with a maximum serving capacity of 'b' customers.
Journal ArticleDOI

Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations

TL;DR: The state probabilities at service completion, vacation termination, arbitrary, and prearrival epochs, the loss probabilities of the first-, an arbitrary- and the last-customer in a batch, and other performance measures along with numerical aspects have been discussed.
Journal ArticleDOI

A continuous review ( s , Q ) inventory system with priority customers and arbitrarily distributed lead times

TL;DR: This article analyzes a lost sales (s,Q) inventory system with two types of customers and stochastic lead times and provides numerical examples where differentiation between customers yield lower cost and lower shortage rates for both type of customers.
Journal ArticleDOI

Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations

TL;DR: The analysis of actual waiting time under the first-come-first-served discipline is carried out and the queue-length distributions at departure, service completion, vacation termination, arbitrary and prearrival epochs are obtained.