A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gerhard J. Woeginger / rank
Normal rank
 
Property / author
 
Property / author: Gerhard J. Woeginger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / 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: Scheduling Parallel Machines On-Line / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:06, 29 May 2024

scientific article
Language Label Description Also known as
English
A comment on scheduling on uniform machines under chain-type precedence constraints
scientific article

    Statements

    A comment on scheduling on uniform machines under chain-type precedence constraints (English)
    0 references
    5 March 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    worst-case analysis
    0 references
    scheduling
    0 references
    uniform machines
    0 references
    precedence constraints
    0 references
    makespan
    0 references