Abstract

A simulation-based scheduling mechanism for photo-reconnaissance satellite is presented in this paper. The satellite scheduling problem belongs to a class of single-machine scheduling problems with time window constraint. It is NP-hard in computational complexity. Based on simulation platform, a mixed integer programming model is used to formulate the problem and an advanced tabu algorithm is adopted to solve the MIP. Numerical results demonstrate that this approach is efficient in the scheduling problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call