Abstract
A new heuristic based on Nawaz–Enscore–Ham (NEH) algorithm is proposed for solving permutation flowshop scheduling problem in this paper. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time. Statistical tests illustrate better solution quality of the proposed algorithm, comparing to existing benchmark heuristics.
Original language | English |
---|---|
Pages (from-to) | 1808-1822 |
Number of pages | 15 |
Journal | Engineering Optimization |
Volume | 48 |
Issue number | 10 |
Early online date | 18 Feb 2016 |
DOIs | |
Publication status | Published - 2016 |
Keywords
- heuristic
- flow shop
- makespan
- idle-time