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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: June 2003, Revised: January 2004,
MSC classification:
90C90
Rights and permissions
About this article
Cite this article
Benoist, T., Rottembourg, B. Upper bounds for revenue maximization in a satellite scheduling problem. 4OR 2, 235–249 (2004). https://doi.org/10.1007/s10288-004-0044-8
Issue Date:
DOI: https://doi.org/10.1007/s10288-004-0044-8