Preemptive scheduling to minimize mean weighted flow time (Q910208): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing mean flow time with error constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929047 / rank
 
Normal rank

Latest revision as of 14:50, 20 June 2024

scientific article
Language Label Description Also known as
English
Preemptive scheduling to minimize mean weighted flow time
scientific article

    Statements

    Preemptive scheduling to minimize mean weighted flow time (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    NP-completeness
    0 references
    NP-hardness
    0 references
    preemptive scheduling
    0 references
    mean weighted flow time
    0 references