2021
DOI: 10.1016/j.actaastro.2020.10.020
|View full text |Cite
|
Sign up to set email alerts
|

A precedence-rule-based heuristic for satellite onboard activity planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
9
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 25 publications
0
9
0
Order By: Relevance
“…But this method greatly needs expert knowledge to make complex rules of execution. It is also less scalable for additional tasks and optimality is not always guaranteed [8]. A genetic algorithm (GA) is another alternative to deal with complex problems such as task scheduling.…”
Section: Autonomous Task Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…But this method greatly needs expert knowledge to make complex rules of execution. It is also less scalable for additional tasks and optimality is not always guaranteed [8]. A genetic algorithm (GA) is another alternative to deal with complex problems such as task scheduling.…”
Section: Autonomous Task Schedulingmentioning
confidence: 99%
“…Scheduling of Earth observation satellites' imaging tasks is generally regarded as an optimization problem and many researchers proposed the implementation of different approaches for solving the problem. Liang et.al [8] proposed a heuristic algorithm for subsystem-level onboard task scheduling, which is designed by considering the precedence of onboard tasks and resources needed by target subsystems executing these tasks and reported that the algorithm generated satisfactory scheduling results in a shorter period. In [9,10] studies, customized heuristic algorithms are designed to support the objective function and competent results are reported with shorter computation time.…”
Section: Introductionmentioning
confidence: 99%
“…Element J OB Shop Scheduling Problem (JSSP) has risen as one of the most relevant Combinatorial Optimization Problems (COPs) [1]. This kind of problem has several applications, mainly those related to manufacturing [2]- [6]. The idea in a JSSP is to organize the execution of jobs (tasks) to optimize their processing.…”
Section: Index Termsmentioning
confidence: 99%
“…Update x a, * , x n, * , and x * using Equations (6) to (8) the fitness from the previous step 11: q ← q + 1 12: end while 13: Generate I * by reshaping x * into a JSSP instance as shown in Figure 3 longer to complete (i.e., Largest Processing Time, LPT), the other targets small jobs first (i.e., Shortest Processing Time, SPT). Similarly, we include two heuristics that seek to schedule a whole job quickly or evenly schedule them all.…”
mentioning
confidence: 99%
“…Another challenging task where HHs have proved useful is to solve Job Shop Scheduling Problems (JSSPs). This problem has multiple applications to real-life scenarios, especially those related to manufacturing [18]- [23]. So, it is natural that the JSSP has been tackled with different methods.…”
mentioning
confidence: 99%