This survey deals with problems at the intersection of two scientific fields: graph theory and scheduling. They can either be viewed as scheduling dependent jobs – jobs with resource conflicts – or as graph coloring optimization involving different objective functions. Our main aim is to illustrate the various interesting algorithmic techniques that have been brought to bear. We will also surve...

The broadcast scheduling problem asks how a multihop network of broadcast transceivers operating on a shared medium may share the medium in such a way that communication over the entire network is possible. This can be naturally modeled as a graph coloring problem via distance-2 coloring (L(1, 1)-labeling, strict scheduling). This coloring is difficult to compute and may require a number of col...

The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion, e.g. minimal completion time of all operations. With respect to NP-hardness of these problems and the necessity to solve them by heuristic methods, the problem representation and the effectiveness of their procedures is substantial for computations to be completed in a rea...

Practical vehicle routing problems generally have both routing and scheduling aspects to consider. However, few heuristicmethods exist that address both these complicated aspects simultaneously. We present heuristics to determine an efficient circular traversal of a weighted graph that requires a subset of its edges to be traversed, each a specified (potentially different) number of times. Cons...

Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constraint partitioning of Constraint Satisfaction Problems (CSP). In order to apply the SER mechanism, the graph representing the constraints must receive an acyclic orientation. Since obtaining an optimal acyclic orientation ...

On improved time bounds for permutation graph problems p. 1 A simple test for interval graphs p. 11 Tolerance graphs and orders p. 17 Scheduling and Related Problems On scheduling problems restricted to interval orders p. 27 Scheduling with incompatible jobs p. 37 Generalized coloring for tree-like graphs p. 50 Parallel and Distributed Algorithms I Optimal (parallel) algorithms for the all-to-a...

The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have developed algorithms for process graph scheduling based on list-scheduling and branch-and-bound strategies. One essential contribution is in the manner in which information on process allocation is used in order to efficientl...

A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits. First of all, the problem of unequal-length block-test scheduling under power dissipation constraints is modeled as a tree growing problem. Then a combination of list and force-directed scheduling algorithms is adapted to tackle i...

This paper aims at introducing the concept of selection graph with an application to a non-trivial problem. A selection graph is made of a set of classes, each class having multiple realizations, and of an uncompatibility graph built on these realizations. Coloring a selection graph can be used to solve constrained scheduling, constrained ressource allocation, and dichotomy-based constrained en...

This paper presents a quantitative comparison of a collection of DSP multiprocessor list scheduling heuristics which consider inter-processor communication delays. The following aspects have been addressed: (1) performance in terms of the total execution time (makespan), (2) sensitivity of heuristics in terms of the characteristics of acyclic precedence graphs, including graph size and graph pa...