Scheduling data transfers in a network and the set scheduling problem

This publication has 11 references indexed in Scilit:

• Efficient on-line call control algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
  Mathematics of Operations Research, 1997
• Optimal time-critical scheduling via resource augmentation (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1997
• Approximating total flow time on parallel machines
  Published by Association for Computing Machinery (ACM) ,1997
• Randomized On-line Scheduling of Parallel Jobs
  Journal of Algorithms, 1996
• Lower bounds for on-line graph problems with application to on-line circuit and optical routing
  Published by Association for Computing Machinery (ACM) ,1996
• Approximability and nonapproximability results for minimizing total flow time on a single machine
  Published by Association for Computing Machinery (ACM) ,1996
• Scheduling issues in multimedia query optimization
  ACM Computing Surveys, 1995
• On-line load balancing with applications to machine scheduling and virtual circuit routing
  Published by Association for Computing Machinery (ACM) ,1993
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
  Combinatorica, 1987