Scheduling partially ordered UET tasks on dedicated machines

Publication Type:
Conference Proceeding
IFAC Proceedings Volumes (IFAC-PapersOnline), 2013, 46 (9), pp. 1672 - 1677
Issue Date:
Filename Description Size
1-s2.0-S1474667016345347-main.pdfPublished version248.32 kB
Adobe PDF
Full metadata record
The paper is concerned with scheduling partially ordered unit execution time tasks on dedicated machines. The considered scheduling model is important in control of different systems, in particular computer systems. The presented algorithm is an alternative to the conventional branch-and-bound method. In contrast to the branch-and-bound method with its single search tree, corresponding to partitioning of the feasible region, the presented method involves a sequence of search trees each associated with a certain portion of the domain of the objective function. The branching is based on a generalisation of the Garey-Johnson due date modification. The performance of the presented algorithm is compared by means of computational experiments with a version of the branch-and-bound algorithm. © IFAC.
Please use this identifier to cite or link to this item: