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.5375" id="M274" style="vertical-align:-3.25793pt" version="1.1" viewbox="0 0 67.050003 14.5375" width="67.050003" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,14.5375)">
<g transform="translate(72,-60.37)">
<text transform="matrix(1,0,0,-1,-71.95,63.67)">
<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">𝐷</tspan>
</text>
<text transform="matrix(1,0,0,-1,-49.09,60.55)">
<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,-37.66,63.67)">
<tspan style="font-size: 12.50px; " x="0" y="0">,</tspan>
<tspan style="font-size: 12.50px; " x="5.2012482" y="0">𝐷</tspan>
<tspan style="font-size: 12.50px; " x="15.078618" y="0">]</tspan>
</text>
</g>
</g>
</svg>.</table>

Mathematical Problems in Engineering

fig4

Figure 4

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