Complexity of scheduling multiprocessors tasks with prespecified processor allocations

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

    Onderzoeksoutput: Boek/rapportRapportAcademic

    115 Downloads (Pure)

    Samenvatting

    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.
    Originele taal-2Engels
    Plaats van productieEindhoven
    UitgeverijTechnische Universiteit Eindhoven
    Aantal pagina's13
    StatusGepubliceerd - 1992

    Publicatie series

    NaamMemorandum COSOR
    Volume9232
    ISSN van geprinte versie0926-4493

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Complexity of scheduling multiprocessors tasks with prespecified processor allocations'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit