Abstract
Consider a set of n tasks with a tree precedence relation and two possible execution times, say 1 and 2. An O(n log n) algorithm is presented for optimally scheduling these tasks on two identical processors. Possible generalizations as well as the relations between this algorithm and other scheduling algorithms are described.
Original language | English (US) |
---|---|
Pages | 480-490 |
Number of pages | 11 |
State | Published - 1981 |
Event | Proc Annu Allerton Conf Commun Control Comput 18th - Monticello, IL, USA Duration: Oct 8 1980 → Oct 11 1980 |
Conference
Conference | Proc Annu Allerton Conf Commun Control Comput 18th |
---|---|
City | Monticello, IL, USA |
Period | 10/8/80 → 10/11/80 |
All Science Journal Classification (ASJC) codes
- General Engineering