A stochastic recirculation system with random access
type: Item
instance of: scholarly article
title: A stochastic recirculation system with random access
zbMATH Open document ID: 0643.90027
DOI: 10.1016/0377-2217(85)90157-2
author: Behnam Pourbabai
author: David Sonderman
published in: European Journal of Operational Research
publication date: 1985-01-01T00:00:00Z
review text: A model for a stochastic recirculation system with randomly accessed multiple heterogeneous servers, no waiting rooms, and exponentially- distributed service times is provided. In this system the units are assigned to one of the servers upon arrival by a random mechanism. Units which find all servers busy recirculate and combine with the incoming arrivals and join those already in the system to initiate the next cycle. The equilibrium behavior of the internal and external stochastic processes of the system is analyzed using a two parameter approximation. A simulation model is also developed and its behavior is compared against the analytical model at the steady state. The model with randomly- accessed servers is compared to a single server model already established in the literature. The performance of the model is then examined for a wide range of parameter values to obtain conclusions about it optimal performances
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 65C20
zbMATH DE Number: 4049359
MaRDI profile type: Publication
full work available at URL: 0377-2217(85)90157-2
OpenAlex ID: W2087977198
cites work: Two inverse problems concerning the superposition of recurrent point processes
cites work: On Poisson Approximations for Superposition Arrival Processes in Queues
cites work: Ordered thinnings of point processes and random measures
cites work: Q5684037
cites work: Q5526518
cites work: Q5643354
cites work: Q4404200
cites work: Q4772521
cites work: A Characterization of M/G/1 Queues with Renewal Departure Processes
cites work: Return policies for an inventory system with positive and negative demands
cites work: Erlang’s Formulas in the Theory of Mass Service
cites work: Time-Sharing Service Systems. II
cites work: The Interrupted Poisson Process As An Overflow Process
cites work: Approximate Analysis of General Queuing Networks by Decomposition
cites work: Characterising the Finite Capacity GI/M/1 Queue with Renewal Output
cites work: Some Inequalities in Queuing
cites work: A versatile Markovian point process
cites work: Limit theorems for thinning of renewal point processes
cites work: Q3213966
cites work: Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room
cites work: Q3292873
cites work: Approximate Solutions for Some Two-Stage Tandem Queues, Part 1: Individual Arrivals at the Second Stage
cites work: Über die in einem einfachen Verlustsystem induzierten stochastischen Prozesse
cites work: Compositions, inverses and thinnings of random measures
cites work: A comparison of waiting time approximations in series queueing systems
cites work: On the Limiting Distribution of the Number of Coincidences Concerning Telephone Traffic
cites work: Approximating a Point Process by a Renewal Process, I: Two Basic Methods
cites work: Approximating a Point Process by a Renewal Process: The View Through a Queue, an Indirect Approach
cites work: Approximations for departure processes and queues in series
description: scientific article; zbMATH DE number 4049359