Online scheduling to minimize average stretch
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Scheduling data transfers in a network and the set scheduling problemPublished by Association for Computing Machinery (ACM) ,1999
- Minimizing the flow time without migrationPublished by Association for Computing Machinery (ACM) ,1999
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation AlgorithmsMathematics of Operations Research, 1997
- Approximating total flow time on parallel machinesPublished by Association for Computing Machinery (ACM) ,1997
- Chapter 9 Sequencing and scheduling: Algorithms and complexityPublished by Elsevier ,1993
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985