Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_left">Variable</td><td class="align_center">Number</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">Z, Cmax</td><td class="align_center">1</td></tr><tr><td class="align_left">Cj, Tardj</td><td class="align_center">n</td></tr><tr><td class="align_left">Stij, Cij</td><td class="align_center">mn</td></tr><tr><td class="align_left">Xijk</td><td class="align_center">mn (n − 1)</td></tr><tr><td class="align_left">Yijk</td><td class="align_center">mn (m − 1)</td></tr><tr><td class="align_left">Aijl</td><td class="align_center">mnb</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Complexity

tab1

Table 1

Table 1: Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem 