Searching for authors named "Ioannis Milis" – sorted by Relevance.
-
Scheduling UET-UCT Series-Parallel Graphs on Two Processors
- The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the make
- Cited by 9 (0 self) – Add To MetaCart
-
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
- We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel
- Add To MetaCart
-
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
- We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel
- Cited by 50 (16 self) – Add To MetaCart

