On a multiconstrained model for chromatic scheduling Original Research Article

A graph coloring model is described for handling some types of chromatic scheduling problems. Applications in school timetabling for instance as well as in robotics suggest to include additional requirements like sets of feasible colors for each node of the associated graph and upper bounds on the cardinalities of the color classes. Necessary conditions for the existence of solutions are given and cases where these conditions are sufficient will be characterized.