Complexity of scheduling multiprocessors tasks with prespecified processor allocations

J.A. Hoogeveen, S.L. Velde, van de, B. Veltman

    Research output: Book/ReportReportAcademic

    97 Downloads (Pure)

    Abstract

    We investigate the computational complexity of scheduling multiprocessor tasks with prespecified processor allocations. We consider two criteria: minimizing schedule length and minimizing the sum of the task completion times. In addition, we investigate the complexity of problems when precedence constraints or release dates are involved. Key words & Phrases: Multiprocessor tasks, prespecified processor allocations, makespan, total completion time, release dates, precedence constraints.
    Original languageEnglish
    Place of PublicationEindhoven
    PublisherTechnische Universiteit Eindhoven
    Number of pages13
    Publication statusPublished - 1992

    Publication series

    NameMemorandum COSOR
    Volume9232
    ISSN (Print)0926-4493

    Fingerprint Dive into the research topics of 'Complexity of scheduling multiprocessors tasks with prespecified processor allocations'. Together they form a unique fingerprint.

  • Cite this

    Hoogeveen, J. A., Velde, van de, S. L., & Veltman, B. (1992). Complexity of scheduling multiprocessors tasks with prespecified processor allocations. (Memorandum COSOR; Vol. 9232). Technische Universiteit Eindhoven.