Upper bounds for revenue maximization in a satellite scheduling problem
Upper bounds for revenue maximization in a satellite scheduling problem
复制标题
DOI：
10.1007/s10288-004-0044-8
复制
发表时间：
2004-10
期刊：
影响因子：
--
通讯作者：
T. Benoist;B. Rottembourg
中科院分区：
文献类型：
--
作者：
T. Benoist;B. Rottembourg
本文提出了卫星收入选择和调度问题（SRSS）的上限。定义了这种带有时间窗的广义旅行推销员收奖问题的紧凑模型，并通过基于任务间隔推理的有效不等式进行了丰富。还研究了要最大化的目标函数的非凹性。最后，俄罗斯套娃方法结合了嵌套子问题的界限。 SRSS 问题的这些第一个上限与法国 OR 学会组织的优化挑战基准的最著名解决方案进行了比较。
This paper presents upper bounds for theSatellite Revenue Selection and Schedulingproblem (SRSS). A compact model of this generalizedPrize Collecting Traveling Salesman Problem with Time Windowsis 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.