Minimizing average flow-time under knapsack constraint (Q896150): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust maximum completion time measure for scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Minimizing Average Flow-Time on Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average flow time on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140449 / rank
 
Normal rank

Latest revision as of 05:33, 11 July 2024

scientific article
Language Label Description Also known as
English
Minimizing average flow-time under knapsack constraint
scientific article

    Statements

    Minimizing average flow-time under knapsack constraint (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    multiprocessor scheduling
    0 references
    average flow-time
    0 references
    0 references