Scheduling unit-time tasks with integer release times and deadlines
β Scribed by Greg N. Frederickson
- Book ID
- 113162620
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 271 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider the problem of deciding if there is a feasible preemptive schedule for a set of n independent tasks with release times and deadlines on m identical processors. The general problem is known to be solvable in O(n 3) time. In this paper, we study special cases for which faster algorithms ex
A set of n independent and periodical tasks are considered. The processing times and the deadlines are described by fuzzy numbers. We try to ΓΏnd the optimal assignment of priorities not to miss deadlines. We manage the problem in two ways: ΓΏrst, we solve the problem by introducing the new cost funct