Add to ORKGGraph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling
Scheduling jobs with pairwise con icts is modeled by the graph multi-coloring problem. It occurs in ...
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizi...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling...
..'40 The graph coloring problem is defined, and its impor-tance in several applications is not...
AbstractA graph coloring model is described for handling some types of chromatic scheduling problems...
In this paper, we introduce a graph multi-coloring problem where each vertex must be assigned a give...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
A method using graph coloring was developed for optimizing solutions to the timetabling problem, spe...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
AbstractScheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It oc...
AbstractIn open shop and class-teacher timetabling problems preassignment requirements are often pre...
In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs...
By a proper colouring of a simple graph, we mean an assignment of colours to its vertices with adjac...
Scheduling jobs with pairwise con icts is modeled by the graph multi-coloring problem. It occurs in ...
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizi...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling...
..'40 The graph coloring problem is defined, and its impor-tance in several applications is not...
AbstractA graph coloring model is described for handling some types of chromatic scheduling problems...
In this paper, we introduce a graph multi-coloring problem where each vertex must be assigned a give...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
A method using graph coloring was developed for optimizing solutions to the timetabling problem, spe...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
AbstractScheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It oc...
AbstractIn open shop and class-teacher timetabling problems preassignment requirements are often pre...
In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs...
By a proper colouring of a simple graph, we mean an assignment of colours to its vertices with adjac...
Scheduling jobs with pairwise con icts is modeled by the graph multi-coloring problem. It occurs in ...
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizi...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo