Research Article
Heuristics for the Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup times
| | Source | Degrees of freedom | Sum of squares (SS) | Mean square | F-value |
| | Model | 215 | 3.378 × 1013 | 1.571 × 1011 | 153.88 | | Error | 864 | 8.822 × 1011 | 1.021 × 109 | | | Corrected total | 1079 | 3.466 × 1013 | | | | Size | a − 1 = 2 | 8.639 × 1012 | 4.320 × 1012 | 4230.43 | | Flexibility | b − 1 = 2 | 7.674 × 1010 | 3.837 × 1010 | 37.58 | | Size ∗ flexibility | (a − 1) (b − 1) = 4 | 2.288 × 1011 | 5.721×10105 | 56.03 | | Proportion | c − 1 = 7 | 1.344 × 1013 | 1.919 × 1012 | 1879.66 | | Size ∗ proportion | (a − 1) (c − 1) = 14 | 1.111 × 1013 | 7.933 × 1011 | 776.91 | | Flexibility ∗ proportion | (b − 1) (c − 1) = 14 | 1.065 × 1011 | 7.606 × 109 | 7.45 | | Size ∗ flexibility ∗ proportion | (a − 1) (b − 1) (c − 1) = 28 | 1.713 × 1011 | 6.117 × 109 | 5.99 | | Algorithm | d − 1 = 2 | 2.562 × 109 | 1.281 × 109 | 1.25 | | Size ∗ algorithm | (a − 1) (d − 1) = 4 | 1.849 × 109 | 4.622 × 108 | 0.45 | | Flexibility ∗ algorithm | (b − 1) (d − 1) = 4 | 3.642 × 108 | 9.105 × 107 | 0.09 | | Size ∗ flexibility ∗ algorithm | (a − 1) (b − 1) (d − 1) = 8 | 2.424 × 108 | 3.030 × 107 | 0.03 | | Proportion ∗ algorithm | (c − 1) (d − 1) = 14 | 4.034 × 109 | 2.881 × 108 | 0.28 | | Size ∗ proportion ∗ algorithm | (a − 1) (c − 1) (d − 1) = 28 | 3.308 × 109 | 1.181 × 108 | 0.12 | | Flexibility ∗ proportion ∗ algorithm | (b − 1) (c − 1) (d − 1) = 28 | 2.755 × 109 | 9.838 × 107 | 0.10 | | Size ∗ flexibility ∗ proportion ∗ algorithm | (a − 1) (b − 1) (c − 1) (d − 1) = 56 | 3.378 × 109 | 6.032 × 107 | 0.06 | | Error | (r − 1)abcd = 864 | 8.822 × 1011 | 1.021 × 109 | | | Corrected total | abcdr − 1 = 1079 | 3.466 × 1013 | | |
|
|
