Abstract

We study the problem of scheduling groups of tasks with precedence constraints on three dedicated processors. Each task requires a specified set of processors. Up to three precedence constraints are considered among groups of tasks requiring the same set of processors. The objective of the problem is to find a nonpreemptive schedule which minimizes the maximum completion time (makespan). This scheduling problem is equivalent to the problem of finding an extension of the constraint graph (i.e. the graph which represents the conflicts between tasks and the precedence constraints) to a comparability graph with minimum (over all the extensions) maximum clique weight. The problem is NP-hard in the strong sense. A normal schedule is such that all the tasks requiring the same set of processors are scheduled consecutively. With a normal schedule the problem reduces to the quotient graph of the constraint graph. In this paper we obtain tight approximation results for the minimum makespan of a normal schedule through tight results on the minimum increase of the maximum clique weight when the (partially oriented) quotient graph is extended to a comparability graph.

Author Keywords: Scheduling; Normal schedule; Comparability graph; Maximum clique weight; Approximation algorithm

Article Outline

1. Introduction

2. Basic results

2.1. There exist two internal strong pairs for

2.2. There exist one internal strong pair and one external strong pair for

3. Preorientations with two precedence constraints

4. Preorientations with three precedence constraints

5. The scheduling problem

6. Conclusions

Acknowledgements

References