Graph colouring approaches for a satellite range scheduling problem
From MaRDI portal
Publication:835607
DOI10.1007/s10951-008-0066-8zbMath1168.90481OpenAlexW1985603248MaRDI QIDQ835607
Philippe Giaccari, Nicolas Zufferey, Patrick Amstutz
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://archive-ouverte.unige.ch/unige:5263
Related Items
A new oscillator coupling function for improving the solution of graph coloring problem, Route-reduction-based dynamic programming for large-scale satellite range scheduling problem, An exact algorithm with learning for the graph coloring problem, High-performance technique for satellite range scheduling, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem, Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm, Heuristics for a project management problem with incompatibility and assignment costs, An exact approach for the vertex coloring problem, A new ant colony optimization algorithm for the lower bound of sum coloring problem, Unnamed Item, Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites, Multi-coloring and job-scheduling with assignment and incompatibility costs, Graph Coloring Models and Metaheuristics for Packing Applications, Consistent neighborhood search for combinatorial optimization, Coloring large graphs based on independent set extraction, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Metaheuristics for a scheduling problem with rejection and tardiness penalties, Tackling the maximum happy vertices problem in large networks, Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach, QUEST -- a new quadratic decision model for the multi-satellite scheduling problem, Scheduling of a constellation of satellites: creating a mixed-integer linear model, A memetic algorithm for graph coloring, A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Variable space search for graph coloring
- Minimizing late jobs in the general one machine scheduling problem
- Variable neighborhood search
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Reformulation descent applied to circle packing problems
- Operations research in space and air
- Earth observation satellite management
- Future paths for integer programming and links to artificial intelligence
- Probabilistic diversification and intensification in local search for vehicle routing
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An adaptive memory algorithm for the \(k\)-coloring problem
- AFSCN scheduling: how the problem and solution have evolved
- A survey of local search methods for graph coloring
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
- New methods to color the vertices of a graph
- Ants can colour graphs
- Maximizing the value of an Earth observation satellite orbit
- Scheduling space-ground communications for the air force satellite control network
