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="14.75" id="M273" style="vertical-align:-3.25793pt" version="1.1" viewbox="0 0 62.525002 14.75" width="62.525002" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,14.75)">
<g transform="translate(72,-60.2)">
<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>
</text>
<text transform="matrix(1,0,0,-1,-37.63,60.37)">
<tspan style="font-size: 8.75px; " x="0" y="0">0</tspan>
<tspan style="font-size: 8.75px; " x="4.3759999" y="0">.</tspan>
<tspan style="font-size: 8.75px; " x="6.5640001" y="0">5</tspan>
</text>
<text transform="matrix(1,0,0,-1,-26.19,63.5)">
<tspan style="font-size: 12.50px; " x="0" y="0">]</tspan>
</text>
</g>
</g>
</svg>. </table>

Mathematical Problems in Engineering

fig3

Figure 3

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