We study the area target scheduling problem in satellite networks, aiming at maximizing coverage ratio whilst minimizing response time. To balance these two conflicting objectives, we consider their weighted sum and formulate an integer programming problem. By leveraging this problem’s underlying structure, we equivalently decompose it into two nested subproblems. We then propose an approximation algorithm that is shown to have $1-e^{-1}$ performance bound. Finally, our simulation results show that the maximum performance loss is within 8% over a wide range of weights between the coverage ratio and the response time.

中文翻译：

---

平衡卫星网络区域目标调度中的覆盖和响应时间

我们研究了卫星网络中的区域目标调度问题，旨在最大化覆盖率同时最小化响应时间。为了平衡这两个相互冲突的目标，我们考虑它们的加权和并制定一个整数规划问题。通过利用这个问题的底层结构，我们等价地将其分解为两个嵌套的子问题。然后我们提出了一个近似算法，该算法被证明具有$1-e^{-1}$性能约束。最后，我们的模拟结果表明，在覆盖率和响应时间之间的广泛权重范围内，最大性能损失在 8% 以内。