Chromatic scheduling and frequency assignment

DOI10.1016/0166-218X(94)90207-0zbMath0801.90067MaRDI QIDQ1327228

Y. Gay, Dominique de Werra

Publication date: 18 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

flexible manufacturing systemsgraph coloringchannel assignmentfrequency assignmentchromatic scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

On the use of some known methods for \(T\)-colorings of graphs ⋮ Coloration de graphes : fondements et applications ⋮ Preassignment requirements in chromatic scheduling ⋮ A tabu search algorithm for frequency assignment ⋮ Time slot scheduling of compatible jobs ⋮ Proper colorability of segment intersection graphs ⋮ Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems ⋮ The maximum saving partition problem ⋮ On the combinatorial structure of chromatic scheduling polytopes ⋮ Cycle-based facets of chromatic scheduling polytopes ⋮ Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques ⋮ Unnamed Item ⋮ General vertex-distinguishing total coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• An introduction to timetabling
• Consecutive colorings of graphs
• New methods to color the vertices of a graph
• An inequality for the chromatic number of a graph
• Chromatic Scheduling and the Chromatic Number Problem

This page was built for publication: Chromatic scheduling and frequency assignment