Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time.
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), (2018): 778.0-789
In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p(j), release date r(j) and weight w(j). The goal is to find a preemptive schedule which minimizes the sum of weighted flow-time of jobs, where the flow-time of a job is the difference between its completion tim...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)