Scheduling UET-UCT tasks: branch-and-bound search in the priority space

Universal Academy Press Inc
Publication Type:
Conference Proceeding
7th International conference on optimisation: techniques and applications (ICOTA7), 2007, pp. 1 - 12
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2007001581.pdf1.77 MB
Adobe PDF
The paper is concerned iwth the problem of scheduling partially ordered unit execution time tasks on parallel processors with unit communication delays and release times. Two criteria are considered the maximum lateness and its particular case, the makespan. This problem plays an important role in scheduling theoery and was originally inspired by the applications to the multi-processor computer systems
Please use this identifier to cite or link to this item: