A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286)

From MaRDI portal
Revision as of 11:13, 7 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 dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
scientific article

    Statements

    A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (English)
    0 references
    0 references
    1990
    0 references
    polynomial algorithm
    0 references
    due dates
    0 references
    single machine
    0 references
    sum of the weights of the late jobs
    0 references
    Time and space bounds
    0 references
    pseudopolynomial time bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references