Minimizing the stretch when scheduling flows of divisible requests (Q835622): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101083305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean flow time scheduling problems with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for average stretch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization of local BLAST service on workstation clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for preemptive weighted flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the stretch when scheduling flows of divisible requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling to Minimize Average Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of preemptive minsum scheduling on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228498 / rank
 
Normal rank

Latest revision as of 22:53, 1 July 2024

scientific article
Language Label Description Also known as
English
Minimizing the stretch when scheduling flows of divisible requests
scientific article

    Statements

    Minimizing the stretch when scheduling flows of divisible requests (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    bioinformatics
    0 references
    heterogeneous computing
    0 references
    scheduling
    0 references
    divisible load
    0 references
    linear programming
    0 references
    stretch
    0 references
    0 references