A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679)

From MaRDI portal
Revision as of 23:23, 31 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
A general scheme for solving a large set of scheduling problems with rejection in FPT time
scientific article

    Statements

    A general scheme for solving a large set of scheduling problems with rejection in FPT time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 May 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling with rejection
    0 references
    fixed parameter tractable
    0 references
    single machine
    0 references
    parallel machines
    0 references
    flow-shop
    0 references
    \( \mathcal{NP} \)-hard
    0 references