Analysis of a Batch Service Queueing System Associated with Inventory Transport

2021 ◽  
pp. 153-166
Author(s):  
Achyutha Krishnamoorthy ◽  
Anu Nuthan Joshua
Keyword(s):  
Queueing System ◽  
Batch Service

A queueing system with non-recurrent input and batch servicing

1965 ◽  
Vol 2 (02) ◽  
pp. 442-448
Author(s):  
C. Pearce
Keyword(s):  
Distribution Function ◽  
Queueing System ◽  
Arrival Process ◽  
Batch Service ◽  
Service Times

We consider a queueing system in which arrivals occur at times , and after every kth arrival a servicing of k arrivals is begun. We assume that the number of servers is infinite. Initially, at t 0 = 0, the system is empty and the arrival process {tn } is about to start. The batch service times are independently and identically distributed with distribution function No assumption is made about the process {tn }.

A non-exponential queueing system with independent arrivals and batch servicing

1990 ◽  
Vol 27 (02) ◽  
pp. 401-408
Author(s):  
Nico M. Van Dijk ◽  
Eric Smeitink
Keyword(s):  
Queue Length ◽  
Queueing System ◽  
Length Distribution ◽  
Service Systems ◽  
Batch Service ◽  
Repair System ◽  
Theoretical Interest ◽  
Form Expression ◽  
Queue Length Distribution ◽  
Service Times

We study a queueing system with a finite number of input sources. Jobs are individually generated by a source but wait to be served in batches, during which the input of that source is stopped. The service speed of a server depends on the mode of other sources and thus includes interdependencies. The input and service times are allowed to be generally distributed. A classical example is a machine repair system where the machines are subject to shocks causing cumulative damage. A product-form expression is obtained for the steady state joint queue length distribution and shown to be insensitive (i.e. to depend on only mean input and service times). The result is of both practical and theoretical interest as an extension of more standard batch service systems.

A queueing system with non-recurrent input and batch servicing

1965 ◽  
Vol 2 (2) ◽  
pp. 442-448 ◽  
Author(s):  
C. Pearce
Keyword(s):  
Distribution Function ◽  
Queueing System ◽  
Arrival Process ◽  
Batch Service ◽  
Service Times

We consider a queueing system in which arrivals occur at times , and after every kth arrival a servicing of k arrivals is begun. We assume that the number of servers is infinite. Initially, at t0= 0, the system is empty and the arrival process {tn} is about to start. The batch service times are independently and identically distributed with distribution function No assumption is made about the process {tn}.

A queueing system with alternate batch service

1992 ◽  
Vol 32 (7) ◽  
pp. 917-922
Author(s):  
S.D. Sharma ◽  
K.S. Basati
Keyword(s):  
Queueing System ◽  
Batch Service

An ‘(s, S)’ inventory in a queueing system with batch service facility

2015 ◽  
Vol 258 (2) ◽  
pp. 263-283 ◽  
Author(s):  
S. R. Chakravarthy ◽  
Arunava Maity ◽  
U. C. Gupta
Keyword(s):  
Queueing System ◽  
Batch Service ◽  
Service Facility

scholarly journals System occupancy in a multiclass batch-service queueing system with limited variable service capacity

2019 ◽  
Vol 293 (1) ◽  
pp. 3-26
Author(s):  
Jens Baetens ◽  
Bart Steyaert ◽  
Dieter Claeys ◽  
Herwig Bruneel
Keyword(s):  
Queueing System ◽  
Batch Service ◽  
Service Capacity
Sign in / Sign up

Export Citation Format

Share Document