Open Problem—M/G/1 Scheduling with Preemption Delays (Q5113909): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Multi-armed bandits with switching penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polling Models With and Without Switchover Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐Armed Bandit Allocation Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic scheduling with precedence relations and switching costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Queueing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of index policies for stochastic scheduling with switching penalties / rank
 
Normal rank

Revision as of 23:36, 22 July 2024

scientific article; zbMATH DE number 7213020
Language Label Description Also known as
English
Open Problem—M/G/1 Scheduling with Preemption Delays
scientific article; zbMATH DE number 7213020

    Statements

    Open Problem—M/G/1 Scheduling with Preemption Delays (English)
    0 references
    0 references
    18 June 2020
    0 references
    stochastic networks
    0 references
    control
    0 references
    optimization
    0 references
    scheduling
    0 references
    \(M/G/1\)
    0 references

    Identifiers