Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable

DOI10.1007/s10951-012-0291-zzbMath1280.90063OpenAlexW2015578934MaRDI QIDQ2434306

Jan H. van Vuuren, I. Nieuwoudt

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-012-0291-z

zbMATH Keywords

maximum degree colouringscheduling with conflictshared resource scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• On the order of uniquely (k,m)-colourable graphs
• Graph coloring with cardinality constraints on the neighborhoods
• Extremal results on defective colorings of graphs
• Uniquely \((m,k)^ \tau\)-colourable graphs and \(k-\tau\)-saturated graphs
• The complexity of generalized graph colorings
• Defective coloring revisited
• TWO RESULTS ON GENERALIZED CHROMATIC NUMBERS
• On a graph coloring problem arising from discrete tomography
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• New methods to color the vertices of a graph
• Detour Chromatic Numbers
• Finding the chromatic number by means of critical graphs
• Chromatic Scheduling and the Chromatic Number Problem
• Sur le coloriage des graphs
• Acyclic colorings of planar graphs