Asymmetric path-relinking based heuristics for large-scale job scheduling problem in TDRSS

  title={Asymmetric path-relinking based heuristics for large-scale job scheduling problem in TDRSS},
  author={Peng Lin and Linling Kuang and Xiang Chen and Jian Yan and Jianhua Lu and Xiaojuan Wang},
  journal={9th International Conference on Communications and Networking in China},
In the busy-day scheduling scenario for tracking and data relay satellite system (TDRSS) provided by NASA, there are generally more than 400 jobs to be scheduled over two TDRSs, which builds up a large-scale job scheduling problem (LJSP) on multiple parallel machines. Since the global optima of such a LJSP can only be obtained with Non-deterministic Polynomial (NP) complexity, some classical heuristic algorithms, e.g., the GRASP, are often used to approach local optima with lower efficiency. In… CONTINUE READING
1 Citations
15 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 15 references

Adaptive Subsequence Adjustment with Evolutionary Asymmetric Path-relinking for TDRSS Scheduling

  • P. Lin, L. L. Kuang, X. Chen
  • Journal of Systems Engineering and Electronics,
  • 2014
Highly Influential
12 Excerpts

, and William L . Brown . Single processor scheduling with job priorities and arbitrary ready and due times

  • Surender D. Reddy
  • 2006

CSP Model of the Relay Satellite Scheduling

  • Y. S. Fang, Y. W. Chen, Z. X. Gu
  • Journal of National University of Defence…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…