Results 241 to 250 of about 42,286 (292)
Some of the next articles are maybe not open access.
Maximum Values in Queueing Processes
Probability in the Engineering and Informational Sciences, 1995Motivated by extreme-value engineering in service systems, we develop and evaluate simple approximations for the distributions of maximum values of queueing processes over large time intervals. We provide approximations for several different processes, such as the waiting times of successive customers, the remaining workload at an arbitrary time, and ...
Berger, Arthur W., Whitt, Ward
openaire +2 more sources
Merging Processes of Pedestrian Queues
2013We consider the merging of two pedestrian queues in a simple cellular automaton model. The scenario is restricted to the case of a minimal merging area (2 cells), which corresponds to the intersection of two small corridors in reality. We derive exact results for the flow and present numerical results.
Weber, Daniel +2 more
openaire +1 more source
Advances in Applied Probability, 1976
The paper reviews various aspects, mostly mathematical, concerning the output or departure process of a general queueing systemG/G/s/Nwith general arrival process, mutually independent service times,sservers (1 ≦s≦ ∞), and waiting room of sizeN(0 ≦N≦ ∞), subject to the assumption of being in a stable stationary condition. Known explicit results for the
openaire +1 more source
The paper reviews various aspects, mostly mathematical, concerning the output or departure process of a general queueing systemG/G/s/Nwith general arrival process, mutually independent service times,sservers (1 ≦s≦ ∞), and waiting room of sizeN(0 ≦N≦ ∞), subject to the assumption of being in a stable stationary condition. Known explicit results for the
openaire +1 more source
A Controlled Transportation Queueing Process
Management Science, 1970A transportation queueing process in which taxis arrive in a Poisson process and customers arrive as a renewal process independent of taxi-arrival process is controlled by calling extra taxis whenever the total number of customers lost to the system reaches a certain predetermined number.
openaire +2 more sources
Fluid queues to solve jump processes
Performance Evaluation, 2005We consider systems which exhibit a mixture of smooth behavior and occasional jumps, controlled by continuous-time Markovian processes on a finite state space, and we call these fluid queues with jumps, thereby emphasizing the fact that they constitute a generalization of fluid queues. We characterize their stationary distribution in an algorithmically
Dzial, Tessa +4 more
openaire +2 more sources
Process Variation Aware Issue Queue Design
2008 Design, Automation and Test in Europe, 2008In sub-90 nm process technology it becomes harder to control the fabrication process, which in turn causes variations between the design-time parameters and the fabricated parameters. Variations in the critical process parameters can result in significant fluctuations in the switching speed and leakage power consumption of different transistors in the ...
Raghavendra K, Madhu Mutyam
openaire +1 more source
Risk processes analyzed as fluid queues
Scandinavian Actuarial Journal, 2005This paper presents the Laplace transform of the time until ruin for a fairly general risk model. The model includes both the classical and most Sparre-Andersen risk models with phase-distributed claim amounts as special cases. It also allows for correlated arrival processes, and claim sizes that depend upon environmental factors such as periods of ...
Badescu, Andrei +5 more
openaire +2 more sources
2020
Queueing theory is of interest for the performance evaluation of service systems featuring the two related phenomena of congestion and delay, which could be a nuisance. This is the case for communications and computer systems, in addition to the classical systems of operations research featuring ticket booths, freeway tolls and the like.
openaire +1 more source
Queueing theory is of interest for the performance evaluation of service systems featuring the two related phenomena of congestion and delay, which could be a nuisance. This is the case for communications and computer systems, in addition to the classical systems of operations research featuring ticket booths, freeway tolls and the like.
openaire +1 more source
Formulas on Queues in Burst Processes-II
Bell System Technical Journal, 1973Queues arising in buffers due to either random interruptions of the channel or variable source rates are analyzed in the framework of a single switched system. Examples of systems to which the results of the paper may be applied are: multiplexing of speech with data in telephone channels and, in certain instances, buffering of data generated by the ...
Sondhi, M. M. +2 more
openaire +1 more source
Operations Research, 1964
General single server queues are considered with (i) arrivals in single units and batched departures, (ii) batched arrivals and departures in single units. Queue sizes at the following instants are compared: (1) just before arrivals; (2) just after departures; (3) through time.
openaire +2 more sources
General single server queues are considered with (i) arrivals in single units and batched departures, (ii) batched arrivals and departures in single units. Queue sizes at the following instants are compared: (1) just before arrivals; (2) just after departures; (3) through time.
openaire +2 more sources