Seite - 123 - in Algorithms for Scheduling Problems
Bild der Seite - 123 -
Text der Seite - 123 -
Algorithms 2018,11, 50
Figure7.Branch-and-boundoptimizationresult.
Figure8.Gradientalgorithmoptimizationresult.
Resultsofanalysisgivesusunderstandingthat foramodestdimensionalityschedulingproblem
bothconsideredapproachesareapplicable.However,as thenumberofoperations inmanufacturing
proceduregrowsand thenumber of orders increases,wewill experience an enormousgrowthof
algorithmiterations forenumeration(branch-and-bound) techniqueandthegradient-alikealgorithm
willobviouslydetect localoptimumasthebestachievablesolution(whichmeans theoptimization
resultswilldiffermoreandmorecompared to thedigits inTable1). Risingdifferencebetween the
results is showninTable2.
Expanding thepreviousproblemforaprocedureof500operations in2orderswewillget the
resultspresented inTable3.
123
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