Abstract
We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra and Rinnoy Kan [Annals of Disc. Math., 1977] in their seminal work introduced this problem and showed that it is strongly NP-hard, even when all processing times and weights are 1. We study the approximability of the problem and our main result is an O(log k)- approximation algorithm for instances with k distinct job deadlines.
Cite
CITATION STYLE
Efsandiari, H., Hajiaghyi, M. T., Könemann, J., Mahini, H., Malec, D., & Sanit À, L. (2015). Approximate Deadline-Scheduling with precedence constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 483–495). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
