Simplifying Multiproject Scheduling Problem Based on Design Structure Matrix and Its Solution by an Improved aiNet Algorithm

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td align="left">General aiNet model</td><td align="center">The opt-aiNet optimization for MRCMPSP</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td align="left">Network cell</td><td align="center">Candidate scheduling scheme</td></tr><tr><td align="left">Fitness</td><td align="center">The makespan of multi-projects</td></tr><tr><td align="left">Affinity</td><td align="center">Euclidean distance between the parametric vectors of two candidate scheduling schemes</td></tr><tr><td align="left">Clone</td><td align="center">Candidate scheduling scheme with the same parameters</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

New meaning of the terms in general aiNet-searching method.

Discrete Dynamics in Nature and Society

tab2

Table 2

Table 2: Simplifying Multiproject Scheduling Problem Based on Design Structure Matrix and Its Solution by an Improved aiNet Algorithm 