An approximation method for the \(M/G/1\) retrial queue with general retrial times (Q1333502): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/0377-2217(94)90286-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037290448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-line repeated orders queueing systems<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Service System with Unfilled Requests Repeated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a G/M/K/O queueing loss system with heterogeneous servers and retrials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on retrial queues / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:50, 22 May 2024

scientific article
Language Label Description Also known as
English
An approximation method for the \(M/G/1\) retrial queue with general retrial times
scientific article

    Statements

    An approximation method for the \(M/G/1\) retrial queue with general retrial times (English)
    0 references
    0 references
    15 December 1994
    0 references
    stochastic decomposition
    0 references
    single-server queueing system
    0 references
    Poisson process
    0 references
    retrial queue
    0 references
    approximation method
    0 references

    Identifiers