Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (Q3826352)

From MaRDI portal
Revision as of 18:55, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
scientific article

    Statements

    Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (English)
    0 references
    1989
    0 references
    preemptive scheduling
    0 references
    parallel machines
    0 references
    NP-hard
    0 references
    fixed set of uniform machines
    0 references
    polynomial time
    0 references
    0 references
    0 references

    Identifiers