Results 111 to 120 of about 3,485 (230)

On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times

, 2007
We study the asymptotics of the stationary sojourn time Z of a "typical customer" in a tandem of single-server queues. It is shown that in a certain "intermediate" region of light-tailed service time distributions, Z may take a large value mostly due to ...
S. G. Foss, Foss, S. G.; id_orcid
core   +1 more source

A discrete-time system with service control and repairs

International Journal of Applied Mathematics and Computer Science, 2014
This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of ...
Atencia Ivan
doaj   +1 more source

Discrete-Time Retrial Queuing Systems with Last-Come-First-Served (LCFS) and First-Come-First-Served (FCFS) Disciplines: Negative Customer Impact and Stochastic Analysis

Mathematics
This paper examines a discrete-time retrial queuing system that incorporates negative customers, system breakdowns, and repairs. In this model, an arriving customer has the option to go directly to the server, pushing the currently served customer, if ...
Iván Atencia-Mckillop, Sixto Sánchez-Merino, Inmaculada Fortes-Ruiz, José Luis Galán-García   +3 more
doaj   +1 more source

Sojourn Time Distributions in the Queue Defined by a General QBD Process ∗

, 2008
We consider a general QBD process as defining a FIFO queue and obtain the stationary distribution of the sojourn time of a customer in that queue as a matrix exponential distribution, which is identical to a phase-type distribution under a certain ...
Toshihisa Ozawa
core  

Sojourn times in a two-stage queueing network with blocking

, 2004
The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked.
Gómez-Corral, Antonio
core   +1 more source

Equilibrium Strategies for Overtaking-Free Queueing Networks under Partial Information

Mathematics
We investigate the equilibrium strategies for customers arriving at overtaking-free queueing networks and receiving partial information about the system’s state.
David Barbato, Alberto Cesaro, Bernardo D’Auria   +2 more
doaj   +1 more source

Optimization of Worker Redeployment for Enhancing Customer Service Performance

Information
This study considers ways in which workers can be allocated dynamically in the few hours before the truck departure to flush the system of orders that are almost completed, thereby increasing the service performance of the system.
Hyunho Kim, Wonseok Kang, Eunmi Lee
doaj   +1 more source

Sojourn times in polling systems with various service disciplines

, 2009
We consider a polling system of N queues Q1,…,QN, cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times.
Bruin, J., Fralix, B.H., Boxma, O.J.
core   +1 more source

Dependence Structure of Sojourn Times via Partition Separated Ordering

, 2002
We investigate the joint distribution of successive sojourn times of customers traversing a path in Jackson networks. It si shown in a general..
Ryszard Szekli, Hans Daduna
core  

The sojourn time problem for a $p$-adic random walk and its applications to the spectral diffusion of proteins

, 2022
We consider the problem of the distribution of the sojourn time in a compact set $\mathbb{Z}_{p}$ in the case of a $p$-adic random walk. We rely on the results of our previous studies of the distribution of the first return time for a $p$-adic random ...
Zubarev, A. P., Bikulov, A. Kh.
core