Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (Q5090138)

From MaRDI portal
Revision as of 15:13, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7558101
Language Label Description Also known as
English
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
scientific article; zbMATH DE number 7558101

    Statements

    Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (English)
    0 references
    0 references
    0 references
    15 July 2022
    0 references
    scheduling theory
    0 references
    cyclic job shop
    0 references
    identical jobs
    0 references
    computational complexity theory
    0 references
    polynomial algorithm
    0 references
    pseudopolynomial algorithm
    0 references

    Identifiers