Allocation of buffer capacities in queueing networks with arbitrary topologies (Q1315349): 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 / describes a project that uses
 
Property / describes a project that uses: MARCA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of manufacturing systems using queueing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and 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: On equivalencies of blocking mechanisms in queueing networks with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Influence of Storage Bin Capacity on the Average Standstill Time of a Production Line / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:17, 22 May 2024

scientific article
Language Label Description Also known as
English
Allocation of buffer capacities in queueing networks with arbitrary topologies
scientific article

    Statements

    Allocation of buffer capacities in queueing networks with arbitrary topologies (English)
    0 references
    0 references
    0 references
    0 references
    10 March 1994
    0 references
    The authors present two algorithms to allocate \(M\) buffers to \(N\) service stations which are connected in a feedforward manner. All service times and the interarrival times are assumed to be exponentially distributed. The algorithms use appropriate decompositions of the network followed by iterative improvements.
    0 references
    0 references
    0 references
    0 references
    0 references
    service models
    0 references
    queueing networks
    0 references