A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467)

From MaRDI portal
Revision as of 21:44, 3 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
A note on the complexity of the problem of two-agent scheduling on a single machine
scientific article

    Statements

    A note on the complexity of the problem of two-agent scheduling on a single machine (English)
    0 references
    0 references
    12 October 2007
    0 references
    Production/scheduling
    0 references
    Multi-agent deterministic sequencing
    0 references
    Games/group decisions
    0 references
    Cooperative sequencing
    0 references

    Identifiers