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)

Volumn 3019, Issue , 2004, Pages 105-112

  Jansen, Klaus ^a   Solis Oba, Roberto ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Approximation algorithm; Chains; Constraints; Scheduling

Indexed keywords

ALGORITHMS; CHAINS; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS;

CENTRAL PROBLEMS; CONSTRAINTS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PRECEDENCE CONSTRAINTS; RELATED MACHINES; SCHEDULING JOBS; SCHEDULING THEORY; SCIENTIFIC APPLICATIONS;

APPROXIMATION ALGORITHMS;

EID: 35048899753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24669-5_14     Document Type: Article

References (11)

1. C. Chekuri and M.A. Bender, An efficient approximation algorithm for minimizing makespan on uniformly related machines, Journal of Algorithms, 41 (2002), pp. 212-224.
2. F.A. Chudak and D.B. Shmoys, Approximation algorithms for precedence constrained scheduling problems on parallel machines that run at different speeds, Journal of Algorithms 30, 1999, pp. 323-343.
3. J. Du, J.Y.T. Leung, and G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time, Information and Computation 92, 1991, pp. 219-236.
4. T. Gonzalez and S. Sahni, Preemptive scheduling of uniform processor systems, Journal of the ACM, 25 (1978), pp. 92-101.
5. L.A. Goldberg, M. Paterson, A. Srinivasan, and E. Sweedyk, Bettor approximation guarantees for job-shop scheduling, SIAM Journal on Discrete Mathematics, 14 (2001), pp. 67-92.
6. D.S. Hochbaum and D.B. Shmoys, A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach, SIAM Journal on Computing, 17 (1988), pp. 539-551.
7. T.C. Hu, Parallel sequencing and assembly line problems, Operations Research, 9 (1961), pp. 841-848.
8. W. Kubiak, B. Penz, and D. Trystram, Scheduling chains on uniform processors with communication delays, Journal of Scheduling, 5 (2002), pp. 459-476.
9. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity. In: S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.) Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North Holland, Amsterdam, pp. 445-522.
10. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Operations Research 26, pp. 22-35.
11. G. Woeginger, A comment on scheduling uniform machines under chain-type precedence constraints, Operations Research Letters, 26 (3), 2000, pp. 107-109.