Makespan minimization in online scheduling with machine eligibility (Q5919997)

From MaRDI portal
Revision as of 10:59, 12 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6196478
Language Label Description Also known as
English
Makespan minimization in online scheduling with machine eligibility
scientific article; zbMATH DE number 6196478

    Statements

    Makespan minimization in online scheduling with machine eligibility (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2013
    0 references
    parallel machine scheduling
    0 references
    eligibility constraint
    0 references
    tree-hierarchical and GoS processing sets
    0 references
    interval and nested processing sets
    0 references
    online and semi-online scheduling
    0 references
    offline scheduling
    0 references
    makespan
    0 references
    competitive ratio
    0 references

    Identifiers