UET-scheduling with constrained processor allocations

H. Kellerer, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    11 Citations (Scopus)


    We consider a generalization of the precedence constrained scheduling problem of n unit execution time jobs on m parallel machines without preemption:associated with each job is a subset of the machines, and a job can only be processed on one of the machines associated with the job. We show that this problem is NP-complete in general and present polynomial algorithms for three special cases.
    Original languageEnglish
    Pages (from-to)1-8
    Number of pages8
    JournalComputers & Operations Research
    Issue number1
    Publication statusPublished - 1992


    Dive into the research topics of 'UET-scheduling with constrained processor allocations'. Together they form a unique fingerprint.

    Cite this