Scheduling UET-UCT tasks: branch-and-bound search in the priority space
- 5 March 2009
- journal article
- research article
- Published by Springer Nature in Optimization and Engineering
- Vol. 11 (4) , 627-646
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Scheduling Algorithms2004
- An iterative algorithm for scheduling UET tasks with due dates and release timesEuropean Journal of Operational Research, 2003
- An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum latenessAnnals of Operations Research, 1998
- Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic AlgorithmJournal of Parallel and Distributed Computing, 1997
- UET scheduling with unit interprocessor communication delaysDiscrete Applied Mathematics, 1987
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976