Results 241 to 250 of about 906,917 (283)

On bounds for bulk arrival queues

European Journal of Operational Research, 1984
Abstract This paper gives a simple and effective approach pf deriving bounds for bulk arrival queues by making use of the bounds for single arrival queues. With this approach, upper bounds of mean actual/virtual waiting times and mean queue length at random epochs can be derived for the bulk arrival queues GI X /G/1 and GI X /G/ c (lower bounds ...
Yao, David D. W., Chaudhry, M. L., Templeton, J. G. C.   +2 more
openaire   +2 more sources

On a bulk arrival bulk service infinite service queue

Stochastic Analysis and Applications, 1998
This paper considers an infinite server queue in continuous time in which arrivals are in batches of variable size X and service is provided in groups of fixed size R. We obtain analytical results for the number of busy servers and waiting customers at arbitrary time points. For the number of busy servers, we obtain a recursive relation for the partial
P.V. Ushakumari, A. Krishnamoorthy
openaire   +1 more source

Analysis of queue network system with bulk arrival

Arya Bhatta Journal of Mathematics and Informatics, 2022
The present paper deals with the development of a network queue model consisting of a service channel commonly linked in series with two queuing subsystems. Each of the two subsystems incorporates two parallel service channels. The arrival takes place at the first subsystem in batches of fixed sizes and service pattern follows the poison distribution ...
Neha Gupta, Deepak Gupta, Renu Gupta
openaire   +1 more source

A Hybrid Chain and A Double-Tuple Variable Bulk Arrival and Static Bulk Service Model

2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 2021
This paper proposes a new hybrid chain, and a double-tuple variable bulk arrival and static bulk service (VBASBS) model to assess its performance. The proposed hybrid chain consists of a permissioned chain (e.g. Hyperledger) and a permission-less chain (e.g., Ethereum) with the double-tuple VBASBS-type queues, one per each chain, respectively.
Abhilash Kancharla, Jongho Seol, Noh-Jin Park, Tao Feng, Nohpill Park   +4 more
openaire   +2 more sources

Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times

Transportation Science, 1987
In a queuing system that does not serve each customer immediately upon his arrival, a risk-neutral customer will attempt to arrive at a time that minimizes the expected length of his wait. The consequences of such behavior are explored for a queue with scheduled service.
Amihai Glazer, Refael Hassin
openaire   +3 more sources

One Server Queue with Bulk Arrivals

2017
This paper deals with a queuing system \(GI^{\nu }|M|1|\infty \), i. e., single server queue with general renewal arrivals, exponentially distributed service times and infinite number of waiting positions. The purpose is to find the steady-state results in terms of the probability-generating functions for the number of customers in the queue.
A. D. Soloviev, V. N. Sobolev
openaire   +2 more sources

Cyclic Queues with Bulk Arrivals

Journal of the ACM, 1973
This paper deals with a single-server station (a computer) where each customer's demand comprises an independent random number of jobs (programs). Under certain assumptions, two cyclic disciplines are mathematically analyzed: (a) continuous job service—a round-robin discipline where the quantum's length is distributed as the service requirement of a ...
openaire   +2 more sources

Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals

Transportation Science, 1986
Iterative numerical procedures are investigated for the study of queue lengths and waiting times in bulk arrival, bulk service queues. For queues with compound Poisson arrivals, the procedure uses the imbedded Markov chain to study a variety of vehicle dispatching strategies.
openaire   +3 more sources

Computational Analysis of a Multi-Server Bulk Arrival with Two Modes Server Breakdown

Mathematical and Computational Applications, 2005
An extensive Monte Carlo study is performed to analyze a multi-server, bulk arrival (M [x]M/C; C-1/FCFS) queuing system. The system breakdown limits the system to serve with either C or (C-1) servers.
N Hassan
exaly   +2 more sources

Controlled Markovian bulk-arrival and bulk-service queues with catastrophes

SCIENTIA SINICA Mathematica, 2015
In this paper, we study a Markovian bulk-arrival and bulk-service queues with state-dependent control and catastrophes. Some properties of the generating functions of the corresponding q -matrix are firstly investigated in detail. By using the generating functions, the first effective catastrophe occurrence time is considered, explicit expression for ...
JunPing LI, LiNa ZHANG
openaire   +1 more source