Scheduling chains to minimize mean flow time (Q290213): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wiesław X. Kubiak / rank
Normal rank
 
Property / author
 
Property / author: Q494075 / rank
Normal rank
 
Property / author
 
Property / author: Paolo Dell'Olmo / rank
Normal rank
 
Property / author
 
Property / author: Wiesław X. Kubiak / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023677 / 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: Scheduling chain-structured tasks to minimize makespan and mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the completion time variance minimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:56, 12 July 2024

scientific article
Language Label Description Also known as
English
Scheduling chains to minimize mean flow time
scientific article

    Statements

    Scheduling chains to minimize mean flow time (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    analysis of algorithms
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references

    Identifiers