APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS-Reference-Cited by-同舟云学术

APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS

Published:2010-02 Issue:01 Volume:21 Page:27-49
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

JANSEN KLAUS¹,SOLIS-OBA ROBERTO²

Affiliation:

1. Institut für Informatik und Praktische Mathematik, Universität zu Kiel, Kiel, Germany

2. Department of Computer Science, The University of Western Ontario, London, Canada

Abstract

We study the problem of scheduling jobs with precedence constraints and present two polynomial time approximation schemes for it. The first one is for the case when the machines are identical and the precedence graph partitions the jobs into groups of fixed size. As an interesting particular case, this yields a polynomial time approximation scheme for scheduling jobs with chain or tree precedence constraints on identical machines, when each chain or tree is of constant size. The second approximation scheme is for scheduling jobs with arbitrarily long chain precedence constraints on uniformly related machines when the number of machines is fixed.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054110007118

Reference16 articles.

1. Scheduling Independent Multiprocessor Tasks

2. Scheduling multiprocessor tasks with chain constraints

3. An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines

4. Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

5. Scheduling chain-structured tasks to minimize makespan and mean flow time