Seite - 122 - in Algorithms for Scheduling Problems
Bild der Seite - 122 -
Text der Seite - 122 -
Algorithms 2018,11, 50
3.Resultsof theComputationalExperiment
Asareference trial example letus take the followingschedulingproblem. Themanufacturing
procedurecontains13operations that require6different resources. Thescheduleof themanufacturing
procedure forasingleorder is showninFigure5. In thisexample,wewant toplace twoordersat the
depictedresourcesandstartevaluatingfromthepoint ‘allorders inarow’ (seeFigure6).
Figure5.Ganntdiagramforsingleordermanufacturingprocedure.
Figure6.Ganntdiagramforstartingpointof twoordersscheduleoptimization.
Theresultsofevaluatingbranch-and-boundandgradientalgorithmareplaced in the following
Table 1. The resulting schedules are depicted in Figure 7 (for branch-and-bound algorithm) and
Figure8 (forgradientalgorithm).
122
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