A heuristic for the minimum cost chromatic partition problem

2020 ◽  
Vol 54 (3) ◽  
pp. 845-871 ◽  
Author(s):  
Celso C. Ribeiro ◽  
Philippe L. F. dos Santos

The graph coloring problem consists in coloring the vertices of a graph G=(V, E) with a minimum number of colors, such as that any two adjacent vertices receive different colors. The minimum cost chromatic partition problem (MCCPP) is an extension of the graph coloring problem in which there are costs associated with the colors and one seeks a vertex coloring minimizing the sum of the costs of the colors used in each vertex. The problem finds applications in VLSI design and in some scheduling problems modeled on interval graphs. We propose a trajectory search heuristic using local search, path-relinking, and perturbations for solving MCCPP and discuss computational results.

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 246
Author(s):  
Yuri N. Sotskov ◽  
Еvangelina I. Mihova

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.


Author(s):  
A. Guzmán-Ponce ◽  
J. R. Marcial-Romero ◽  
R. M. Valdovinos ◽  
R. Alejo ◽  
E. E. Granda-Gutiérrez

2015 ◽  
Vol 73 ◽  
pp. 138-145 ◽  
Author(s):  
Meriem Bensouyad ◽  
Nousseiba Guidoum ◽  
Djamel-Eddine Saïdouni

Sign in / Sign up

Export Citation Format

Share Document