Graph colouring approaches for a satellite range scheduling problem

Abstract

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NPhard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be scheduled on several resources, while respecting time and capacity constraints. In the permutation solution space, which is widely used by other researchers, a solution is represented by a permutation of the jobs, and a schedule builder is needed to generate and evaluate a feasible schedule from the permutation. On the contrary, our heuristics are based on the solution space which contains all the feasible schedules. Based on the similarities between the graph colouring problem and the MuRRSP, we show that the latter solution space has significant advantages. A tabu search and an adaptive memory algorithms are designed to tackle the MuRRSP. These heuristics are derived from efficient graph colouring methods. Numerical experiments, performed on large, realistic, and challenging instances, showed that our heuristics are very competitive, robust, and outperform algorithms based on the permutation solution space

A Tabu Search Algorithm for Ground Station Scheduling Problem

“…All scheduling variants, in their general formulations, are highly constrained problems and have been shown computationally hard [2], [10], [12], [17]. Therefore their resolution is tackled through heuristics approaches.…”

Human-Machine Interaction in Solving Tasks of the Planning Department

“…Automated conflicts resolution can be carried out using, for example, methods of solving SRS discussed in [4,5,[12][13][14][15][16][17][18].…”

“…Most papers related to SRS [4,5,12,13] discuss mainly a schedule (plan) optimization. Various approaches, based on an integer linear programming [12], genetic algorithms [13][14][15][16][17], graph color theory [14,18], etc. [2,6,19,20], are proposed.…”

Algorithm Selection for the Graph Coloring Problem

“…Graph coloring has many applications like scheduling [25,47], register allocation [5], circuit testing [17] etc.…”