A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117)

From MaRDI portal
Revision as of 23:32, 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 greedy heuristic for solving scheduling problems with bounded rejection cost
scientific article

    Statements

    A greedy heuristic for solving scheduling problems with bounded rejection cost (English)
    0 references
    0 references
    0 references
    22 June 2022
    0 references
    scheduling
    0 references
    single machine
    0 references
    job-rejection
    0 references
    heuristic
    0 references
    dynamic programming
    0 references

    Identifiers