Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251)

From MaRDI portal
Revision as of 12:44, 4 August 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
Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
scientific article

    Statements

    Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    coupled-tasks
    0 references
    complexity
    0 references
    compatibility graph
    0 references
    polynomial-time approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references