«expected queue size»
۳۴۳ نتیجهصف با دو نوع ورودی، دو نوع سرویس و تعطیلی با شیوه برنولی
In this paper we consider a single server queue with two phase arrival and two phase services. Arrival are Poison variables with different rates. For each input, the server provides private service with exponential distribution. The rates of services are different. The policy of
Performance Analysis of Single Server Retrial Queue with General Retrial Time, Impatient Subscribers, Two Phases of Service and Bernoulli Schedule
This paper analyses the steady state behaviour of an M/G/1 retrial queue with impatient subscribers, two phases of essential service, general retrial time and general vacation time. If the primary call, on arrival finds the server busy, becomes impatient and leaves the system wit
A Back-of-Queue Model of a Signal-Controlled Intersection Approach Developed Based on Analysis of Vehicle Driver Behavior
In smart cities, it is expected that transport, communication as well the movement of people and goods will take place in shortest possible time while maintaining a high level safety. recent years, due to significant increase number passengers vehicles on road capacity limitation
Probability Density for Number of Customers Served During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue or Probability Density for Services During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where both the arrivals and service processes can be serially auto-correlated Matrix Exponential Processes and provide a mechanism to compute the expected number of customers served during
An M/M/2 retrial queueing system with discouragement, breakdowns and repairs
The current work aims to investigate the M/M/2 heterogeneous server retrial queueing system with breakdown and repair, considering discouragement of customers. An arriving customer will enter service facility check for availability servers. On finding either servers free, avail a
An event - driven parallel queue - based microsimulation for large scale traffic scenarios
Traffic flow microsimulations are interesting for transport planning problems due to their high temporal and spatial resolution. Unfortunately, most of them involve high computational costs making them impractical for running large scale scenarios. We present a parallel microsimu
BMAP/BMSP/1 Queue with Randomly Varying Environment
This paper studies two stochastic batch Markovian arrival and batch Markovian service single server queue BMAP/BMSP/1 queue Models (A) and (B) with randomly varying k* distinct environments. The arrival process of the queue has matrix representation {Dm i : 0 ≤ m ≤ M} of order ki
Back to basics: fundamental principles of system dynamics and queueing theory
Ghaffarzadegan and Larson (2018) contend that “many traditional operations research (OR) models can be improved by including feedback processes, as is commonly done in system dynamics (SD) p. 327” modelers build better combining the strengths of both modeling schools. Focusing ma
M/M/1 Bulk Arrival and Bulk Service Queue with Randomly Varying Environment
This paper studies two stochastic bulk arrival and bulk service queueing Models (A) and (B) with k varying environments. The system has infinite storing capacity and the arrival and service sizes are finite valued random variables. Matrix partitioning method is used to study the
PH/PH/1 Bulk Arrival and Bulk Service Queue with Randomly Varying Environment
This paper studies two stochastic bulk arrival and bulk service PH/PH/1 queue Models (A) and (B) with randomly varying k* distinct environments. The arrival and service distributions are (αi , Ti) and (βi , Si) in the environment i for 1 ≤ i ≤ k* respectively. Whenever the enviro