Results 71 to 80 of about 117 (95)

A Priority Retrial Queue with Constant Retrial Policy

open access: yesLecture Notes in Computer Science, 2018
We analyse a priority queueing system with a normal queue (high priority) and an orbit (low priority). Only the first customer in orbit can retry during times that the queue and server are empty (constant retrial policy). In contrast with existing literature, we assume different service time distributions for the high- and low-priority customers.
Arnaud Devos   +2 more
exaly   +3 more sources

Dynamic scheduling of a single-server two-class queue with constant retrial policy

open access: yesAnnals of Operations Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anastasia Winkler
exaly   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Strategic behavior and social optimization in a constant retrial queue with the N -policy

European Journal of Operational Research, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jinting Wang, Xuelu Zhang
exaly   +2 more sources

Strategic Joining in an M/M/1 Constant Retrial Queue with Reserved Idle Time Under N-Policy

open access: yes, 2019
This paper considers an M/M/1 constant retrial queueing model with reserved idle time under N-policy. A customer can occupy the server instantaneously when the server is turned on and idle upon arrival. After the service of the last customer, the server stays idle for some random time.
Jinting Wang, Lulu Li
openaire   +2 more sources

Analysis of Two-Way Communication in $$M_1^X, M_2/G_1,G_2/1$$ Retrial Queue Under the Constant Retrial Policy

Methodology and Computing in Applied Probability
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S K Samanta, Samanta S K
exaly   +2 more sources

Home - About - Disclaimer - Privacy