A Metaheuristic Algorithm to Transporter Scheduling for Assembly Blocks in a Shipyard considering Precedence and Cooperating Constraints

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/ddns/volume-2019/2615154/figures/2615154.fig.005a.svgz" name="2615154.fig.005a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Assignment crossover</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/ddns/volume-2019/2615154/figures/2615154.fig.005b.svgz" name="2615154.fig.005b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Assignment mutation</td></tr></table>

<div>Example of assignment operators.</div>

Discrete Dynamics in Nature and Society

fig5

Figure 5

Figure 5: A Metaheuristic Algorithm to Transporter Scheduling for Assembly Blocks in a Shipyard considering Precedence and Cooperating Constraints 