A note on LPT scheduling (Q5906502): 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: Worst-case analysis of heuristics for open shops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank

Latest revision as of 14:39, 22 May 2024

scientific article; zbMATH DE number 550416
Language Label Description Also known as
English
A note on LPT scheduling
scientific article; zbMATH DE number 550416

    Statements

    A note on LPT scheduling (English)
    0 references
    0 references
    12 April 1994
    0 references
    0 references
    identical parallel machines
    0 references
    heuristics
    0 references
    worst-case performance
    0 references
    largest processing-time-first
    0 references
    parallel-machine scheduling
    0 references