en
Scientific article
Open access
English

Graph colouring approaches for a satellite range scheduling problem

Published inJournal of scheduling, vol. 11, no. 4, p. 263-277
Collection
  • Open Access - Licence nationale Springer
Publication date2008
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.

Keywords
  • Oversubscribed satellite scheduling
  • Graph colouring
  • Heuristics
Citation (ISO format)
ZUFFEREY, Nicolas, AMSTUTZ, Patrick, GIACCARI, Philippe. Graph colouring approaches for a satellite range scheduling problem. In: Journal of scheduling, 2008, vol. 11, n° 4, p. 263–277. doi: 10.1007/s10951-008-0066-8
Main files (1)
Article (Published version)
accessLevelPublic
Identifiers
ISSN of the journal1094-6136
608views
365downloads

Technical informations

Creation02/24/2010 3:01:00 PM
First validation02/24/2010 3:01:00 PM
Update time03/14/2023 3:24:20 PM
Status update03/14/2023 3:24:20 PM
Last indexation05/02/2024 11:29:04 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack