Graph colouring approaches for a satellite range scheduling problem
From MaRDI portal
Publication:835607
DOI10.1007/S10951-008-0066-8zbMATH Open1168.90481OpenAlexW1985603248MaRDI QIDQ835607FDOQ835607
Authors: Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari 
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
Recommendations
- Scheduling space-ground communications for the air force satellite control network
- Scheduling space-ground communications for the air force satellite control network
- A graph coloring algorithm for large scale scheduling problems
- AFSCN scheduling: how the problem and solution have evolved
- Deux problèmes d'ordonnancement en télécommunications par satellite
Cites Work
- Title not available (Why is that?)
- Ants can colour graphs
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- A survey of local search methods for graph coloring
- Variable neighborhood search
- Title not available (Why is that?)
- New methods to color the vertices of a graph
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Using tabu search techniques for graph coloring
- Probabilistic diversification and intensification in local search for vehicle routing
- Approximating the throughput of multiple machines in real-time scheduling
- Maximizing the value of an Earth observation satellite orbit
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
- Reformulation descent applied to circle packing problems
- Title not available (Why is that?)
- Variable space search for graph coloring
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Earth observation satellite management
- An adaptive memory algorithm for the \(k\)-coloring problem
- Three scheduling algorithms applied to the Earth observing systems domain
- Scheduling space-ground communications for the air force satellite control network
- A Lagrangian heuristic for satellite range scheduling with resource constraints
- Minimizing late jobs in the general one machine scheduling problem
- AFSCN scheduling: how the problem and solution have evolved
- Title not available (Why is that?)
- Operations research in space and air
- Solving over-constrained satellite remote sensing problems
- Title not available (Why is that?)
Cited In (26)
- Evaluation of struggle strategy in genetic algorithms for ground stations scheduling problem
- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- Consistent neighborhood search for combinatorial optimization
- Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- A new oscillator coupling function for improving the solution of graph coloring problem
- Tackling the maximum happy vertices problem in large networks
- Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm
- High-performance technique for satellite range scheduling
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A memetic algorithm for graph coloring
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- An exact algorithm with learning for the graph coloring problem
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds
- Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems
- Title not available (Why is that?)
- Graph coloring models and metaheuristics for packing applications
- QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
- Coloring large graphs based on independent set extraction
- Multi-coloring and job-scheduling with assignment and incompatibility costs
Uses Software
This page was built for publication: Graph colouring approaches for a satellite range scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835607)
