MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Ioannis Milis" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 3 documents found, showing 1 through 3.
ATOM RSS
  • Scheduling UET-UCT Series-Parallel Graphs on Two Processors  
  • by Lucian Finta, Zhen Liu, Ioannis Milis, Evripidis Bampis — 1996 — Theoretical Computer Science
  • …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  
  • by Foto Afrati Evripidis, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko — 1999 — In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science
  • …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  
  • by Foto Afrati , Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko — 1999 — IN PROCEEDINGS OF THE 40TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
  • …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
Help! Showing 1 through 3.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB