Upper bounds for revenue maximization in a satellite scheduling problem

@article{Benoist2004UpperBF,
  title={Upper bounds for revenue maximization in a satellite scheduling problem},
  author={Thierry Benoist and Beno{\^i}t Rottembourg},
  journal={4OR},
  year={2004},
  volume={2},
  pages={235-249}
}
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem with Time Windows is defined and enriched with valid inequalities based on task interval reasoning. The non-concavity of the objective function to be maximized is also studied. Finally a Russian Dolls approach combines bounds on nested sub-problems. These first upper bounds for the SRSS problem are compared to best… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Challenge ROADEF 2003: Combinaison de Propagation de Contraintes et de MétaHeuristiques

Y Caseau
2003
View 5 Excerpts
Highly Influenced

Algorithm for management of the missions of the earth observation satellites

E Kuipers
2003
View 1 Excerpt

Une méthode de recherche avec tabous pour la gestion de la mission de satellites d’observation de la terre

JF Cordeau, G Laporte
2003
View 1 Excerpt

Similar Papers

Loading similar papers…