scholarly journals Intensification/Diversification-Driven ILS for a Graph Coloring Problem

2012 ◽  
pp. 160-171
Author(s):  
Samir Loudni
Keyword(s):  
Graph Coloring ◽  
Coloring Problem ◽  
Graph Coloring Problem

A Metaheuristic Algorithm to Face the Graph Coloring Problem

2020 ◽  
pp. 195-208
Author(s):  
A. Guzmán-Ponce ◽  
J. R. Marcial-Romero ◽  
R. M. Valdovinos ◽  
R. Alejo ◽  
E. E. Granda-Gutiérrez
Keyword(s):  
Graph Coloring ◽  
Metaheuristic Algorithm ◽  
Coloring Problem ◽  
Graph Coloring Problem

scholarly journals Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 246
Author(s):  
Yuri N. Sotskov ◽  
Еvangelina I. Mihova
Keyword(s):  
Graph Coloring ◽  
Precedence Constraints ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Due Dates ◽  
Mixed Graph ◽  
Coloring Problem ◽  
Release Times ◽  
Schedule Length ◽  
Graph Coloring Problem

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness for integer due dates to the scheduling problem, where along with precedence constraints given on the set of the multiprocessor tasks, a subset of tasks must be processed simultaneously. Contrary to a classical shop-scheduling problem, several processors must fulfill a multiprocessor task. Furthermore, two types of the precedence constraints may be given on the task set . We prove that the extended scheduling problem with integer release times of the jobs to minimize schedule length may be solved as an optimal mixed graph coloring problem that consists of the assignment of a minimal number of colors (positive integers) to the vertices of the mixed graph such that, if two vertices and are joined by the edge , their colors have to be different. Further, if two vertices and are joined by the arc , the color of vertex has to be no greater than the color of vertex . We prove two theorems, which imply that most analytical results proved so far for optimal colorings of the mixed graphs , have analogous results, which are valid for the extended scheduling problems to minimize the schedule length or maximal lateness, and vice versa.

scholarly journals A New and Fast Evolutionary Algorithm for Strict Strong Graph Coloring Problem

2015 ◽  
Vol 73 ◽  
pp. 138-145 ◽  
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni
Keyword(s):  
Evolutionary Algorithm ◽  
Graph Coloring ◽  
Coloring Problem ◽  
Graph Coloring Problem
Sign in / Sign up

Export Citation Format

Share Document