Page - 122 - in Algorithms for Scheduling Problems

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