Page - 87 - in Algorithms for Scheduling Problems
Image of the Page - 87 -
Text of the Page - 87 -
Algorithms 2018,11, 68
Figure16showsplotsforthecrossoverprobability. Itcanbeseenthatthebestcrossoverprobability
occurring is0.9. Figure17presentsplots for themutationprobability,where theprobabilityof0.2 is
statisticallymoresignificant.
Figure14.Meansand95%LSDconfidence intervalsofmutationoperators.
50
53
56
59
62
0.5 0.7 0.9 1.1 1.3 1.5 1.7 1.9 2.1
Crossover operators
OX PMX
Figure15.Meansand95%LSDconfidence intervalsofcrossoveroperators—twomachinesperstage.
56
59
62
65
68
0.4 0.5 0.6 0.7 0.8 0.9 1
Crossover probability
0. . 0.9
Figure16.Meansand95%LSDconfidence intervalsofcrossoverprobability—fourmachinesperstage.
87
back to the
book Algorithms for Scheduling Problems"
Algorithms for Scheduling Problems
- Title
- Algorithms for Scheduling Problems
- Authors
- Frank Werner
- Larysa Burtseva
- Yuri Sotskov
- Editor
- MDPI
- Location
- Basel
- Date
- 2018
- Language
- English
- License
- CC BY 4.0
- ISBN
- 978-3-03897-120-7
- Size
- 17.0 x 24.4 cm
- Pages
- 212
- Keywords
- Scheduling Problems in Logistics, Transport, Timetabling, Sports, Healthcare, Engineering, Energy Management
- Categories
- Informatik
- Technik