Chromatic Scheduling

نویسندگان

  • Dominique de Werra
  • Alain Hertz
چکیده

Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. We present and illustrate them in specific situations where additional requirements are imposed. We include list-colouring, mixed graph colouring, co-colouring, colouring with preferences, bandwidth colouring, and present applications of edge-colourings to open shop, school timetabling and sports scheduling problems. We also discuss balancing and compactness constraints which often appear in practical situations. Résumé : De nombreuses variations et extensions des modèles de base de coloration des sommets et des arêtes d’un graphe ont été développées pour traiter des problèmes d’horaires de plus en plus complexes. Nous les présentons et les illustrons dans des situations particulières où des contraintes additionnelles sont imposées. Nous incluons la coloration par liste, la coloration mixte, les co-colorations, les colorations avec préférences, ainsi que les colorations par bandes. Nous présentons également des applications de la coloration des arêtes dans des problèmes d’open shop, d’horaires scolaires et de tournois sportifs. Nous discutons finalement les contraintes d’équlibrage et de compacité qui apparaissent souvent dans les situations pratiques. Les Cahiers du GERAD G–2013–84 1

منابع مشابه

Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques

Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks supplying wireless access to voice/data communication networks to customers with individual communication demands. This bandwidth allocation problem is a special chromatic scheduling problem; both problems are N P-complete and, furthermore, there exist no polynomial-time al...

متن کامل

Multiple Circular Colouring as a Model for Scheduling

In this article we propose a new model for scheduling periodic tasks. The model is based on a variation of the circular chromatic number, called the multiple circular colouring of the conflict graph. We show that for a large class of graphs, this new model will provide better solutions than the original circular chromatic number. At the same time, it allows us to avoid the difficulty of impleme...

متن کامل

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints

We address a generalization of the classical 1and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these constraints we show th...

متن کامل

On the combinatorial structure of chromatic scheduling polytopes

Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplying wireless access to voice/data communication networks for customers with individual communication demands. To maintain the links, only frequencies from a certain spectrum can be used, which typically causes capacity problems. Hence it is necessary to reuse frequen...

متن کامل

Combinatorial equivalence of Chromatic Scheduling Polytopes

Point-to-Multipoint systems are one kind of radio systems supplying wireless access to voice/data communication networks. Capacity constraints typically force the reuse of frequencies but, on the other hand, no interference must be caused thereby. This leads to the bandwidth allocation problem, a special case of so-called chromatic scheduling problems. Both problems are NP-Hard, and there exist...

متن کامل

Chromatic Scheduling of Dynamic Data-Graph Computations

Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance of races between computation occuring on overlapping regions of the graph. Common solutions such as locking protocols and bulk-synchronous execution often sacrifice performanc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013