Explorable uncertainty in scheduling with non-uniform testing times (Q2117694): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient update strategies for geometric computing with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query strategies for priced information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing shortest paths with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Median with Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust knapsack problem with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The update complexity of selection and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization Helps Computing a Minimum Spanning Tree under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search for the Best Alternative / rank
 
Normal rank

Latest revision as of 09:33, 28 July 2024

scientific article
Language Label Description Also known as
English
Explorable uncertainty in scheduling with non-uniform testing times
scientific article

    Statements

    Explorable uncertainty in scheduling with non-uniform testing times (English)
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    online scheduling
    0 references
    explorable uncertainty
    0 references
    competitive analysis
    0 references
    single machine
    0 references
    sum of completion times
    0 references
    makespan
    0 references

    Identifiers