Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint

<table class="table-group" id="tab5"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_center" colspan="2">Algorithm parameters</td><td class="align_center">Amounts</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">Maximum of iteration</td><td class="align_center">MaxIt</td><td class="align_center">100</td></tr><tr><td class="align_left">Number of populations</td><td class="align_center">nPop</td><td class="align_center">40</td></tr><tr><td class="align_left">Maximum number of Archive</td><td class="align_center">nArchive</td><td class="align_center">30</td></tr><tr><td class="align_left">The coefficient of creating harmony in the intersection operator</td><td class="align_center">Gamma</td><td class="align_center">0.6</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>The best parameters for MOEA/D algorithm.</div>

Complexity

tab5

Table 5

Table 5: Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint 

Table 5 | Flexible Flow Shop Scheduling Problem with Reliable Transporters and Intermediate Limited Buffers via considering Learning Effects and Budget Constraint 