Parameterized complexity of machine scheduling: 15 open problems (Q1782183)

From MaRDI portal
Revision as of 12:10, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized complexity of machine scheduling: 15 open problems
scientific article

    Statements

    Parameterized complexity of machine scheduling: 15 open problems (English)
    0 references
    0 references
    0 references
    18 September 2018
    0 references
    parallel machines
    0 references
    shop scheduling
    0 references
    makespan
    0 references
    total completion time
    0 references
    total tardiness
    0 references
    throughput
    0 references
    number of tardy jobs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references