A Two-Stage Three-Machine Flow Shop Assembly Problem Mixed with a Controllable Number and Sum-of-Processing Times-Based Learning Effect by Simulated Annealing Algorithms

<table class="table-group" id="tab8"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_center" colspan="3">Kruskal–Wallis test</td></tr><tr class="thead"><td class="align_left">Chi-square</td><td class="align_center">DF</td><td class="align_center">Pr &gt; ChiSq</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">214.5511</td><td class="align_center">8</td><td class="align_center">&lt;0.0001</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Kruskal–Wallis verification of the small size number of jobs.</div>

Discrete Dynamics in Nature and Society

tab8

Table 8

Table 8: A Two-Stage Three-Machine Flow Shop Assembly Problem Mixed with a Controllable Number and Sum-of-Processing Times-Based Learning Effect by Simulated Annealing Algorithms 

Table 8 | A Two-Stage Three-Machine Flow Shop Assembly Problem Mixed with a Controllable Number and Sum-of-Processing Times-Based Learning Effect by Simulated Annealing Algorithms 