Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr><td align="left">job</td><td align="center" colspan="3">Operations routing (processing time)</td></tr><tr><td align="left" colspan="4"><hr/></td></tr><tr><td align="left">1</td><td align="center">1 <svg height="13.45" id="M124" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 18.35 13.45" width="18.35" 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="4.1634989" y="0">3</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">)</tspan>
</text>
</g>
</g>
</svg></td><td align="center">1</td><td align="center">1 <svg height="13.45" id="M125" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 18.35 13.45" width="18.35" 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="4.1634989" y="0">3</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">)</tspan>
</text>
</g>
</g>
</svg></td></tr><tr><td align="left">2</td><td align="center">1 <svg height="13.45" id="M126" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 18.35 13.45" width="18.35" 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="4.1634989" y="0">2</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">)</tspan>
</text>
</g>
</g>
</svg></td><td align="center">2</td><td align="center">1 <svg height="13.45" id="M127" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 18.35 13.45" width="18.35" 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="4.1634989" y="0">2</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">)</tspan>
</text>
</g>
</g>
</svg></td></tr><tr><td align="left">3</td><td align="center">2 <svg height="13.45" id="M128" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 18.35 13.45" width="18.35" 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="4.1634989" y="0">3</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">)</tspan>
</text>
</g>
</g>
</svg></td><td align="center">3</td><td align="center">2 <svg height="13.45" id="M129" style="vertical-align:-2.21957pt" version="1.1" viewbox="0 0 18.35 13.45" width="18.35" 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="4.1634989" y="0">3</tspan>
<tspan style="font-size: 12.50px; " x="10.414999" y="0">)</tspan>
</text>
</g>
</g>
</svg></td></tr><tr class="table-tr"><td colspan="4"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Illustration of an example of 3 * 3 problem.

Journal of Applied Mathematics

tab1

Table 1

Table 1: Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net 