Abstract
This paper deals with the daily imaging scheduling problem for a low-orbit, earth observation satellite, which belongs to a class of single-machine scheduling problems. Its salient features include sequence-dependent setup effects, job-assembly characteristics, and time window constraints. Instead of looking for the global optimal solutions, we adopt a promising evolutionary approach, tabu search, to solve this scheduling problem. Numerical results demonstrate that the approach is effective and efficient in applications to the real problems.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
