Advertisement

Upper bounds for revenue maximization in a satellite scheduling problem

  • Thierry Benoist
  • Benoít Rottembourg
Article

Abstract.

This paper presents upper bounds for the Satellite Revenue Selection and Schedulingproblem (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 known solutions of the benchmark of the optimization challenge organized by the French OR society.

Keywords:

Upper bounds valid inequalities concave costs Russian Dolls 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2004

Authors and Affiliations

  1. 1.Bouygues e-labSt Quentin en Yvelines CedexFrance
  2. 2.Laboratoire Informatique d’Avignon CNRS FRE 2487Avignon CedexFrance

Personalised recommendations