Highly Influenced

# A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

@inproceedings{Cheung2011APA, title={A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems}, author={Maurice Cheung and David B. Shmoys}, booktitle={APPROX-RANDOM}, year={2011} }

- Published 2011 in APPROX-RANDOM
DOI:10.1007/978-3-642-22935-0_12

We consider the following single-machine scheduling problem, which is often denoted 1|| ∑ fj: we are given n jobs to be scheduled on a single machine, where each job j has an integral processing time pj, and there is a nondecreasing, nonnegative cost function fj(Cj) that specifies the cost of finishing j at time Cj ; the objective is to minimize ∑n j=1 fj(Cj). Bansal & Pruhs recently gave the first constant approximation algorithm with a performance guarantee of 16. We improve on this result by… CONTINUE READING

Recent Discussions

This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS