Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Efficient concurrency control for broadcast environments
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Supermodular Relaxation for Scheduling with Release Dates
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs Before Shut-Down
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Minimizing flow time nonclairvoyantly
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Greedy multiprocessor server scheduling
Operations Research Letters
| Hi-index | 0.00 |
In this paper we study some aspects of weighted flow time on parallel machines. We first showthat the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|ri, pmtn|ΣwiFi. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We showthat any c- competitive online algorithm for weighted flow time must also be c- competitive for Deadline Scheduling. We finally give an O(1)-competitive algorithm for Deadline Scheduling.