A retrial queueing system with urgent customers (Q876840): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q592844
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: László Lakatos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-006-0305-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043414679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special cyclic-waiting queueing system with refusals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428751 / rank
 
Normal rank

Latest revision as of 16:42, 25 June 2024

scientific article
Language Label Description Also known as
English
A retrial queueing system with urgent customers
scientific article

    Statements

    A retrial queueing system with urgent customers (English)
    0 references
    19 April 2007
    0 references
    The author considers a queueing system with two types of customers arriving in a Poisson fashion and exponential service times. The customers of the first type require urgent service and join only if the system is free or if there is a customer of first type which is on service. There is no customer of the second type. The service of a customer may be started at the moment of arrival (if the system is free) or at moments differing from it by multiples of a cycle time (in the case of a busy server or queue), according to FIFO rule. The author obtains the ergodic distribution using an embedded Markov chain technique. This paper continues the work of the author [J. Math. Sci. 111, 3541--3544 (2002; Zbl 1108.60075)]
    0 references
    embedded Markov chain
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers