Abstract
The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow "slow" machines to remain idle. © Springer-Verlag Berlin Heidelberg 2004.
Author supplied keywords
Cite
CITATION STYLE
Jansen, K., & Solis-Oba, R. (2004). Approximation algorithms for scheduling jobs with chain precedence constraints. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 105–112. https://doi.org/10.1007/978-3-540-24669-5_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
