2022
DOI: 10.1016/j.cie.2021.107831
|View full text |Cite
|
Sign up to set email alerts
|

Introducing preferences in scheduling applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 48 publications
0
1
0
Order By: Relevance
“…If the outer task is executable, the start and the end time of it in the available time window can be determined by MPA. In the MPA, this paper takes the heuristic rules relating to preference, delay, and random strategies [30,31]. When the GAPE and MPA are terminated, the best solution in all the population is used as the final task sequence, and the final schedulable task sequence is obtained through an EH.…”
Section: Algorithm Designmentioning
confidence: 99%
“…If the outer task is executable, the start and the end time of it in the available time window can be determined by MPA. In the MPA, this paper takes the heuristic rules relating to preference, delay, and random strategies [30,31]. When the GAPE and MPA are terminated, the best solution in all the population is used as the final task sequence, and the final schedulable task sequence is obtained through an EH.…”
Section: Algorithm Designmentioning
confidence: 99%