Complexities of four problems on two-agent scheduling (Q1653276)

From MaRDI portal
Revision as of 18:23, 24 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
Complexities of four problems on two-agent scheduling
scientific article

    Statements

    Complexities of four problems on two-agent scheduling (English)
    0 references
    0 references
    3 August 2018
    0 references
    scheduling
    0 references
    two-agent
    0 references
    number of tardy jobs
    0 references
    NP-hard
    0 references
    pseudo-polynomial time
    0 references

    Identifiers