Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="451090.fig.003a" src="https://static.hindawi.com/articles/jam/volume-2013/451090/figures/451090.fig.003a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Network of a project with 3 resources</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="451090.fig.003b" src="https://static.hindawi.com/articles/jam/volume-2013/451090/figures/451090.fig.003b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Gantt chart of schedule</td></tr></table></td></tr></table>

<table>Project with 13 activities and its corresponding Gantt chart.</table>

Journal of Applied Mathematics

fig3

Figure 3

Figure 3: Shuffled Frog Leaping Algorithm for Preemptive Project Scheduling Problems with Resource Vacations Based on Patterson Set 