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 known solutions of the benchmark of the optimization challenge organized by the French OR society. © Springer-Verlag 2004.
CITATION STYLE
Benoist, T., & Rottembourg, B. (2004). Upper bounds for Revenue maximization in a Satellite Scheduling problem. 4OR, 2(3), 235–249. https://doi.org/10.1007/s10288-004-0044-8
Mendeley helps you to discover research relevant for your work.