Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (Q5963621): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:51, 4 March 2024

scientific article; zbMATH DE number 6544309
Language Label Description Also known as
English
Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
scientific article; zbMATH DE number 6544309

    Statements

    Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan (English)
    0 references
    0 references
    0 references
    23 February 2016
    0 references
    two-agent scheduling
    0 references
    parallel machines
    0 references
    makespan
    0 references
    approximation algorithm
    0 references

    Identifiers