A graph coloring algorithm for large scale scheduling problems

DOI10.1016/0305-0548(86)90061-4zbMath0633.90031OpenAlexW2087316231MaRDI QIDQ1096533

Sanjiv Sarin, Vahid Lotfi

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90061-4

zbMATH Keywords

heuristicNP-completeconflict resolutionexamination schedulingsuboptimal solutions

Mathematics Subject Classification ID

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

Related Items

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, The mutual exclusion scheduling problem for permutation and comparability graphs., Colouring, constraint satisfaction, and complexity, A column generation based algorithm for the robust graph coloring problem, Heuristic methods and applications: A categorized survey, Unnamed Item, An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A graph coloring algorithm for large scheduling problems
• The Complexity of Near-Optimal Graph Coloring
• A system for computing university examination timetables
• Scheduling to reduce conflict in meetings
• The Loading Problem
• An algorithm for the chromatic number of a graph
• Final examination scheduling