Web-Books
im Austria-Forum
Austria-Forum
Web-Books
Informatik
Algorithms for Scheduling Problems
Seite - 189 -
  • Benutzer
  • Version
    • Vollversion
    • Textversion
  • Sprache
    • Deutsch
    • English - Englisch

Seite - 189 - in Algorithms for Scheduling Problems

Bild der Seite - 189 -

Bild der Seite - 189 - in Algorithms for Scheduling Problems

Text der Seite - 189 -

Algorithms 2018,11, 76 thenstrategiesexceptRandandOPTIwouldhavesufficedwithaprobabilityof1. Figure5bdisplays results forLigoworkflows. Here, PHEFTandOHEFTwere thebest strategies, followedbyOPTI andPESS. Figure 6 shows cpw performance profiles of six strategies forMontage andLigoworkflows considering τ = [1. . .1.2]. In both cases, PHEFThad the highest probability of being the better strategyforcpwoptimization. Theprobability that itwasthewinneronagivenproblemwithinfactors of1.1of thebest solutionwasclose to0.85and1forMontageandLigo, respectively. (a) (b) 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1 1.02 1.04 1.061.08 1.1 1.12 1.14 1.16 1.18 1.2 ʏ Rand BC PESS OPTI PHEFT OHEFT 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1 1.02 1.04 1.06 1.08 1.1 1.12 1.14 1.16 1.18 1.2 ʏ Rand BC PESS OPTI PHEFT OHEFT Figure6. cpwperformanceprofile,τ=[1. . .1.2]. (a)Montage; (b)Ligo. Figure7showsthemeanperformanceprofilesofallmetrics, scenariosandtest cases, considering τ=[1. . .1.2]. Therewerediscrepancies inperformancequality. Ifwewant toobtainresultswithin a factorof1.02of thebest solution, thenPHEFTgeneratedthemwithprobability0.8,whileRandwith aprobabilityof0.47. Ifwechoseτ=1.2, thenPHEFTproducedresultswithaprobabilityof0.9,and Randwithaprobabilityof0.76. 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1 1.02 1.04 1.06 1.08 1.1 1.12 1.14 1.16 1.18 1.2 ʏ Rand BC PESS OPTI PHEFT OHEFT Figure7.Meanperformanceprofileoverallmetricsandtest cases,τ=[1. . .1.2]. 7.Conclusions Effective imageandsignalprocessingworkflowmanagementrequires theefficientallocationof tasks to limitedresources. In thispaper,wepresentedallocationstrategies that took intoaccountboth 189
zurück zum  Buch Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
Titel
Algorithms for Scheduling Problems
Autoren
Frank Werner
Larysa Burtseva
Yuri Sotskov
Herausgeber
MDPI
Ort
Basel
Datum
2018
Sprache
englisch
Lizenz
CC BY 4.0
ISBN
978-3-03897-120-7
Abmessungen
17.0 x 24.4 cm
Seiten
212
Schlagwörter
Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
Kategorien
Informatik
Technik
Web-Books
Bibliothek
Datenschutz
Impressum
Austria-Forum
Austria-Forum
Web-Books
Algorithms for Scheduling Problems