Chromatic Scheduling

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

[1]  Mirjana Cangalovic,et al.  About equivalent interval colorings of weighted graphs , 2009, Discret. Appl. Math..

[2]  Dominique de Werra,et al.  Compactness and balancing in scheduling , 1977, Math. Methods Oper. Res..

[3]  Michael A. Trick,et al.  The timetable constrained distance minimization problem , 2006, Ann. Oper. Res..

[4]  A. P. Yershóv ALPHA—An Automatic Programming System of High Efficiency , 1966, JACM.

[5]  Alexandr V. Kostochka,et al.  A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring , 2008, Combinatorics, Probability and Computing.

[6]  Dominique de Werra,et al.  On two coloring problems in mixed graphs , 2008, Eur. J. Comb..

[7]  R. Govindarajan,et al.  Buffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs , 1996, Proceedings of 3rd International Conference on High Performance Computing (HiPC).

[8]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[9]  Dominique de Werra,et al.  On the approximation of Min Split-coloring and Min Cocoloring , 2006, J. Graph Algorithms Appl..

[10]  Margit Voigt,et al.  List colourings of planar graphs , 2006, Discret. Math..

[11]  Joseph Naor,et al.  Tight bounds for dynamic storage allocation , 1994, SODA '94.

[12]  Shai Gutner The complexity of planar graph choosability , 1996, Discret. Math..

[13]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[14]  P. Lax Proof of a conjecture of P. Erdös on the derivative of a polynomial , 1944 .

[15]  Dominique de Werra,et al.  Some models of graphs for scheduling sports competitions , 1988, Discret. Appl. Math..

[16]  Vangelis Th. Paschos,et al.  Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation , 2004, ISAAC.

[17]  Dominique de Werra,et al.  Chromatic Scheduling and Frequency Assignment , 1994, Discret. Appl. Math..

[18]  Stanley M. Selkow,et al.  Some perfect coloring properties of graphs , 1979, J. Comb. Theory, Ser. B.

[19]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[20]  Pierre Hansen,et al.  Mixed graph colorings , 1995, Math. Methods Oper. Res..

[21]  H. A. Kierstead,et al.  The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..

[22]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[23]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[24]  Javier Yáñez,et al.  The robust coloring problem , 2003, Eur. J. Oper. Res..

[25]  Claude Berge,et al.  Motivations and history of some of my conjectures , 1997, Discret. Math..

[26]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[27]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[28]  Guy Kortsarz,et al.  Multicoloring trees , 2003, Inf. Comput..

[29]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[30]  N. S. Narayanaswamy,et al.  Dynamic Storage Allocation and On-Line Colouring Interval Graphs , 2004, COCOON.

[31]  Phokion G. Kolaitis Hardness Of Approximations , 1996 .

[32]  Sandy Irani Coloring inductive graphs on-line , 2005, Algorithmica.

[33]  Krzysztof Giaro The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard , 1997, Ars Comb..

[34]  Mikkel Thorup,et al.  OPT versus LOAD in dynamic storage allocation , 2003, STOC '03.

[35]  Marek Chrobak,et al.  On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..

[36]  Jun Qin,et al.  Coloring interval graphs with first-fit , 1995, Discret. Math..

[37]  Guy Kortsarz,et al.  Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees , 2002, J. Algorithms.

[38]  D. de Werra,et al.  Graph-theoretical models for preemptive scheduling , 1989 .

[39]  Jordan Gergov,et al.  Approximation Algorithms for Dynamic Storage Allocation , 1996 .

[40]  Paul R. Wilson,et al.  Dynamic Storage Allocation: A Survey and Critical Review , 1995, IWMM.

[41]  Guy Desaulniers,et al.  Lower bounds and a tabu search algorithm for the minimum deficiency problem , 2009, J. Comb. Optim..

[42]  Jordan Gergov,et al.  Algorithms for compile-time memory optimization , 1999, SODA '99.

[43]  R. Möhring Algorithmic graph theory and perfect graphs , 1986 .

[44]  Frances E. Allen,et al.  Automatic storage optimization , 2004, SIGP.

[45]  D. de Werra A note on graph coloring , 1974, RAIRO Theor. Informatics Appl..

[46]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[47]  Guy Kortsarz,et al.  Sum Multicoloring of Graphs , 2000, J. Algorithms.

[48]  Alexander Schwartz The deficiency of a regular graph , 2006, Discret. Math..

[49]  Mirjana Cangalovic,et al.  Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths , 1991 .

[50]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[51]  Thomas Erlebach,et al.  Variable Sized Online Interval Coloring with Bandwidth , 2006, Algorithmica.

[52]  Ross M. McConnell,et al.  Linear-Time Recognition of Circular-Arc Graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[53]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[54]  A. Leaf GRAPH THEORY AND PROBABILITY , 1957 .

[55]  Stephan Olariu,et al.  The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). , 1998, ACM-SIAM Symposium on Discrete Algorithms.

[56]  Jan Kratochvíl,et al.  Representing graphs by disks and balls (a survey of recognition-complexity results) , 2001, Discret. Math..

[57]  Rajiv Gandhi,et al.  Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria , 2004, WAOA.

[58]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[59]  Steven Prestwich,et al.  Constrained Bandwidth Multicoloration Neighbourhoods , 2022 .

[60]  B. Roy Nombre chromatique et plus longs chemins d'un graphe , 1967 .

[61]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[62]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[63]  Bernard Ries Coloring some classes of mixed graphs , 2007, Discret. Appl. Math..

[64]  Dieter Kratsch,et al.  On Cocolourings and Cochromatic Numbers of Graphs , 1994, Discret. Appl. Math..

[65]  Guy Kortsarz,et al.  Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs , 2003, Algorithmica.

[66]  Leah Epstein,et al.  Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs , 2006, Algorithmica.

[67]  Vangelis Th. Paschos,et al.  Weighted Coloring: Further Complexity and Approximability Results , 2005, ICTCS.

[68]  Leah Epstein,et al.  Online Interval Coloring and Variants , 2005, ICALP.

[69]  Xuding Zhu,et al.  A Coloring Problem for Weighted Graphs , 1997, Inf. Process. Lett..

[70]  W. Hsu,et al.  AN APPROXIMATION ALGORITHM FOR COLORING CIRCULAR-ARC GRAPHS , 2003 .

[71]  Hal A. Kierstead,et al.  A polynomial time approximation algorithm for dynamic storage allocation , 1991, Discret. Math..

[72]  Thomas Erlebach,et al.  Online Coloring of Intervals with Bandwidth , 2003, WAOA.

[73]  Sriram V. Pemmaraju,et al.  Using graph coloring in an algebraic compiler , 1997, Acta Informatica.

[74]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[75]  Dominique de Werra,et al.  A tutorial on the use of graph coloring for some problems in robotics , 2009, Eur. J. Oper. Res..

[76]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[77]  J. K. Il Precoloring Extension with Fixed Color Bound , 1994 .

[78]  Guy Kortsarz,et al.  Multicoloring: Problems and Techniques , 2004, MFCS.

[79]  Marek Kubale,et al.  Consecutive colorings of the edges of general graphs , 2001, Discret. Math..

[80]  D. de Werra A few remarks on chromatic scheduling , 1975 .

[81]  D. de Werra,et al.  Time slot scheduling of compatible jobs , 2007, J. Sched..

[82]  Bertram C. Bruce,et al.  Problems and techniques of text-analysis , 1980 .

[83]  Leah Epstein,et al.  Online interval coloring with packing constraints , 2005, Theor. Comput. Sci..

[84]  Alain Hertz,et al.  Feasible edge colorings of trees with cardinality constraints , 2000, Discret. Math..

[85]  Rajiv Raman,et al.  Buffer minimization using max-coloring , 2004, SODA '04.