Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Computers and Operations Research
New methods to color the vertices of a graph
Communications of the ACM
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
Earth Observation Satellite Management
Constraints
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
Management Science
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Reformulation descent applied to circle packing problems
Computers and Operations Research
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A graph coloring heuristic using partial solutions and a reactive tabu scheme
Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
Variable space search for graph coloring
Discrete Applied Mathematics
A comparison of techniques for scheduling earth observing satellites
IAAI'04 Proceedings of the 16th conference on Innovative applications of artifical intelligence
AFSCN scheduling: How the problem and solution have evolved
Mathematical and Computer Modelling: An International Journal
Operating system support for distributed applications in real space-time
CSTST '08 Proceedings of the 5th international conference on Soft computing as transdisciplinary science and technology
Coloring large graphs based on independent set extraction
Computers and Operations Research
Computers and Industrial Engineering
A new DSATUR-based algorithm for exact vertex coloring
Computers and Operations Research
Heuristics for a project management problem with incompatibility and assignment costs
Computational Optimization and Applications
An exact approach for the Vertex Coloring Problem
Discrete Optimization
A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem
Journal of Mathematical Modelling and Algorithms
Metaheuristics for robust graph coloring
Journal of Heuristics
Multi-satellite control resource scheduling based on ant colony optimization
Expert Systems with Applications: An International Journal
Genetic algorithms for satellite scheduling problems
Mobile Information Systems
Hi-index | 0.00 |
A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard 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.