This paper presents a historical review and recent developments in mixed graph colorings in
the light of scheduling problems with the makespan criterion. A mixed graph contains both a …

We consider the job shop scheduling problem with unit-time operations and the makespan
criterion. This problem is reduced to finding an optimal colouring of a special class of mixed …

A has a set of vertices, a set of undirected edges, and a set of directed arcs. A of a mixed
graph G is a function c that assigns to each vertex in G a positive integer such that, for each …

A\emph {mixed interval graph} is an interval graph that has, for every pair of intersecting
intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particularly …

Graph coloring is one of the most studied combinatorial optimization problems that can be
used to model several practical problems. This paper develops a reduction of job shop …

Consider a project which consists in a set of operations to be performed, assuming the
processing time of each operation is at most one time period. In this project, precedence and …

We are interested in coloring the edges of a mixed graph, ie, a graph containing unoriented
and oriented edges. This problem is related to a communication problem in job-shop …

In this note we consider two coloring problems in mixed graphs, ie, graphs containing edges
and arcs, which arise from scheduling problems where disjunctive and precedence …

Graph Drawing is a field of research that has application in any field of science that needs to
visualize binary relations. This thesis covers various problems arising when drawing graphs …

We consider the problem of energy-aware joint scheduling of tasks and messages with real-
time constraints in wireless networked embedded systems specifically wireless sensor …