2016 International Computer Symposium (ICS) 2016
DOI: 10.1109/ics.2016.0108
|View full text |Cite
|
Sign up to set email alerts
|

Task Ranking and Allocation Heuristics for Efficient Workflow Schedules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…In this illustrative case study, we compare 2 workflow scheduling algorithms, ie, PEFT 11 and PEFT_MinMax_MaxMin. 46 Their resultant schedules in the simulation experiment are automatically visualized by Pewss, as shown in Figure 24 and Figure 25, respectively. Each visualized workflow schedule, eg, Figure 24, consists of 2 parts.…”
Section: Evaluation Of Pewssmentioning
confidence: 99%
“…In this illustrative case study, we compare 2 workflow scheduling algorithms, ie, PEFT 11 and PEFT_MinMax_MaxMin. 46 Their resultant schedules in the simulation experiment are automatically visualized by Pewss, as shown in Figure 24 and Figure 25, respectively. Each visualized workflow schedule, eg, Figure 24, consists of 2 parts.…”
Section: Evaluation Of Pewssmentioning
confidence: 99%