Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

<table>Comparison of rates between the three algorithms for the case with the interval <svg height="13.45" id="M275" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 48.224998 13.45" width="48.224998" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,13.45)">
<g transform="translate(72,-61.24)">
<text transform="matrix(1,0,0,-1,-71.95,63.5)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑈</tspan>
<tspan style="font-size: 12.50px; " x="8.8146152" y="0">(</tspan>
<tspan style="font-size: 12.50px; " x="12.978114" y="0">0</tspan>
<tspan style="font-size: 12.50px; " x="19.229614" y="0">,</tspan>
<tspan style="font-size: 12.50px; " x="24.430862" y="0">𝐷</tspan>
<tspan style="font-size: 12.50px; " x="34.308231" y="0">]</tspan>
</text>
</g>
</g>
</svg>.</table>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs 