Abstract Resources scheduling in Low Earth Orbit (LEO) satellites is an important optimization problem because of the satellitesʼ specific constraints. This article addresses a scheduling problem for LEO satellites missions to assign resources which could be satellites or ground stations to the most number of requested tasks by considering the tasksʼ priority and satisfying temporal and resource constraints. In this study, first, the scheduling problem is modeled using the graph coloring theory. Then, a new tabu search (TS) algorithm is applied to solve the problem. The proposed algorithm employs a new move function to enhance the exploration ability. Accordingly, an attempt is made to compare the result of the proposed TS with some well-known optimization algorithms. The computational results denote the efficiency of the proposed algorithm, as well as its ability to find schedules that are guaranteed to be near-optimal.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Using an effective tabu search in interactive resources scheduling problem for LEO satellites missions


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2013-04-15


    Format / Umfang :

    9 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Tabu search for production scheduling problems

    Hertz, A. / Widmer, M. | British Library Online Contents | 1995


    Product Service Scheduling Problem with Service Matching Based on Tabu Search Method

    Liu Cheng Hao / Wang Yan Hong / Qiu Jia Wei et al. | DOAJ | 2020

    Freier Zugriff

    Clustering Using Tabu Search

    Lin, W.-J. / Lin, J.-C. | British Library Online Contents | 1997


    Satellites - orbits and missions

    Capderou, Michel | SLUB | 2005