The Solvable Cases of a Scheduling Algorithm (Q2872088)

From MaRDI portal
Revision as of 00:02, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Solvable Cases of a Scheduling Algorithm
scientific article

    Statements

    title
    The Solvable Cases of a Scheduling Algorithm (English)
    0 references
    author
    Sam Walker
    0 references
    Yakov Zinder
    0 references
    publication date
    14 January 2014
    0 references
    zbMATH Keywords
    scheduling theory
    0 references
    solvable cases
    0 references
    precedence constraints
    0 references
    identical parallel machines
    0 references
    preemptions
    0 references
    maximum lateness
    0 references

    Identifiers

    zbMATH DE Number
    6245133
    0 references
    OpenAlex ID
    W315885957
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2872088&oldid=32301635"
    Powered by MediaWiki