A decomposition approximation for finite-buffered flow lines of exponential queues (Q1330552): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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)90207-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016912177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate analysis of exponential tandem queues with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4680350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Method for Tandem Queues with Blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the expansion method for open finite queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalencies of blocking mechanisms in queueing networks with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Method for Open Restricted Queueing Networks / rank
 
Normal rank

Latest revision as of 15:59, 22 May 2024

scientific article
Language Label Description Also known as
English
A decomposition approximation for finite-buffered flow lines of exponential queues
scientific article

    Statements

    A decomposition approximation for finite-buffered flow lines of exponential queues (English)
    0 references
    0 references
    3 January 1995
    0 references
    tandem queueing networks
    0 references
    simulation
    0 references
    flow lines
    0 references
    finite work-in-process buffers
    0 references
    work-in-process inventory
    0 references
    finite-buffered exponential queues
    0 references

    Identifiers