Comparing the minimum completion times of two longest-first scheduling-heuristics (Q300962): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6599394 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
identical parallel machines
Property / zbMATH Keywords: identical parallel machines / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum completion time
Property / zbMATH Keywords: minimum completion time / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case analysis
Property / zbMATH Keywords: worst-case analysis / rank
 
Normal rank

Revision as of 21:54, 27 June 2023

scientific article
Language Label Description Also known as
English
Comparing the minimum completion times of two longest-first scheduling-heuristics
scientific article

    Statements

    Comparing the minimum completion times of two longest-first scheduling-heuristics (English)
    0 references
    0 references
    29 June 2016
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    heuristics
    0 references
    minimum completion time
    0 references
    worst-case analysis
    0 references

    Identifiers