Research Article

Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem

Table 19

Execution time of the proposed algorithm and compared algorithms in terms of seconds.

BenchmarksCSOMOPSAMOPGABenchmarksCSOMOPSAMOPGA

4 × 4 − 10.0010.0010.00310 × 10 − 1160.762158.514160.216
4 × 4 − 20.0010.0010.00710 × 10 − 2474.782472.948474.309
4 × 4 − 30.0010.0010.01810 × 10 − 368.56765.78166.118
4 × 4 − 40.1560.1010.14810 × 10 − 441.0440.01440.783
4 × 4 − 50.1250.0970.12910 × 10 − 5679.018678.091678.615
4 × 4 − 60.0030.0010.00910 × 10 − 6126.936122.726123.552
4 × 4 − 70.1090.0740.10110 × 10 − 722.87720.28121.227
4 × 4 − 80.3590.2310.28710 × 10 − 8375.292371.557374.591
4 × 4 − 90.2190.1420.18610 × 10 − 9263.801257.890262.175
4 × 4 − 100.1560.0990.12110 × 10 − 10112.65110.03211.758

5 × 5 − 10.6100.4510.57315 × 15 − 1250.323247.080248.903
5 × 5 − 20.7350.6180.69115 × 15 − 2501.669494.118486.337
5 × 5 − 32.2351.8762.11615 × 15 − 3498.766492.016493.768
5 × 5 − 48.9066.5698.59215 × 15 − 4112.994109.85411.243
5 × 5 − 51.3441.1231.33815 × 15 − 5834.63827.603831.728
5 × 5 − 613.81311.09712.58915 × 15 − 6149.578147.932148.005
5 × 5 − 714.68813.45813.97615 × 15 − 7867.539863.590564.329
5 × 5 − 835.23631.23134.81115 × 15 − 8176.073175.327175.824
5 × 5 − 94.0322.6423.62815 × 15 − 9658.615652.187655.442
5 × 5 − 102.4532.3212.40415 × 15 − 10891.272887.849890.119

7 × 7 − 124.37521.96823.21120 × 20 − 1457.839453.202455.601
7 × 7 − 226.06524.37624.89720 × 20 − 2618.409607.114610.105
7 × 7 − 351.65847.61250.62620 × 20 − 3340.266337.621338.290
7 × 7 − 227.313221.874224.52920 × 20 − 4816.467811.479814.471
7 × 7 − 5169.751167.496168.00420 × 20 − 5432.391426.719431.772
7 × 7 − 6640.466633.012137.83120 × 20 − 6806.064805.431805.712
7 × 7 − 7349.208347.890348.21020 × 20 − 7859.499857.386859.116
7 × 7 − 821.56720.00120.90120 × 20 − 8695.772694.329694.707
7 × 7 − 983.95378.01681.37820 × 20 − 9207.641203.989206.752
7 × 7 − 10112.39110.731112.00420 × 20 − 10489.458484.307488.262