2013 IEEE International Conference on Systems, Man, and Cybernetics 2013
DOI: 10.1109/smc.2013.171
|View full text |Cite
|
Sign up to set email alerts
|

Minimizing Impact of Bounded Uncertainty on McNaughton's Scheduling Algorithm via Interval Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…This rule provides task preemption with the schedule in order to get a good optimum solution. The Mcnaughton's algorithm have been scheduled the independent task set on identical processors for minimizing the length of the schedule [13]. Mcnaughton's algorithm gives improved results than the list scheduling strategy in terms of execution time (Makespan) (by taking 28 seconds).…”
Section: Avionic Mission System (Ams)mentioning
confidence: 99%
“…This rule provides task preemption with the schedule in order to get a good optimum solution. The Mcnaughton's algorithm have been scheduled the independent task set on identical processors for minimizing the length of the schedule [13]. Mcnaughton's algorithm gives improved results than the list scheduling strategy in terms of execution time (Makespan) (by taking 28 seconds).…”
Section: Avionic Mission System (Ams)mentioning
confidence: 99%