Seite - 92 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 68 Table 17. RIBS of the solution of the Branch and Bound (B&B) algorithm concerning the Pareto frontsolutions. 30×2 30×4 30×6 Eop Cmax Eop Cmax Eop Cmax 2.94 0.12 1.72 0.46 0.50 1.8 1.55 0.17 0.87 0.55 1.02 0.35 0.77 0.33 0.41 0.96 0.42 3.44 1.37 0.23 0.33 1.55 0.46 2.27 1.24 0.30 0.58 0.89 0.62 0.47 0.58 0.45 0.77 0.75 0.60 1.1 0.45 0.59 0.35 1.23 0.55 1.45 0.42 0.73 0.29 1.92 0.43 2.78 0.37 0.86 2.27 0.37 Table18.Computational timeforobtainingPareto frontsolutions. Time(min) Time(min) Time(min) 2machinesper stage 2.85 4machinesper stage 3.77 6machinesper stage 7.55 3.79 5.81 8.6 1.74 6.78 6.7 2.76 5.67 6.6 3.73 3.85 7.62 3.86 4.82 7.66 2.85 4.85 8.61 1.77 4.94 6.76 2.85 5.8 7.4. Comparisonwith Industry Figures24and25showEopandCmaxoftheindustryandtheB&Balgorithm.Theterm“Algorithm” in thesegraphsrepresents theresultsof theB&Balgorithm.The term“Industry”represents theactual dataof theproductioncompany. The industryresults showninTable19areobtainedconsideringthe averagemonthlyproduction loadinkilogramsof tortillasperyear. Theresultsof theB&Balgorithm are obtained for adifferent number ofmachinesper stage. Table 20 shows the same results as in Table19 inpercentages. 96.52 43.82 25.57 186 93 62 0 40 80 120 160 200 2 4 6 Machines per stage Algorithm Industry Figure24.CmaxofB&Balgorithmandindustry. 92