Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (Q6053958)

From MaRDI portal
Revision as of 01:21, 3 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7742786
Language Label Description Also known as
English
Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost
scientific article; zbMATH DE number 7742786

    Statements

    Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost (English)
    0 references
    0 references
    0 references
    27 September 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling with rejection
    0 references
    NP-hard
    0 references
    dynamic programming
    0 references
    FPTAS
    0 references
    0 references
    0 references