Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy (Q854999): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Value iteration and optimization of multiclass queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search of sensitivity in network optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Instability of Fluid Models for Reentrant Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stochastic Matrices Associated with Certain Queuing Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-entrant lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance bounds for queueing networks and scheduling policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STABILITY OF A SIMPLE RE-ENTRANT LINE WITH INFINITE SUPPLY OF WORK : THE CASE OF EXPONENTIAL PROCESSING TIMES(<Special Issue>Network Design, Control and Optimization) / rank
 
Normal rank

Latest revision as of 11:49, 25 June 2024

scientific article
Language Label Description Also known as
English
Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
scientific article

    Statements

    Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy (English)
    0 references
    0 references
    0 references
    20 December 2006
    0 references
    0 references
    queueing
    0 references
    manufacturing
    0 references
    priority scheduling
    0 references
    Markovian multiclass queueing networks
    0 references
    last buffer first served discipline
    0 references
    infinite virtual buffers
    0 references
    steady state distributions
    0 references
    Sample path properties
    0 references
    GI/M/1 queue
    0 references
    0 references