Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic

Flowshop scheduling problems have received considerable research attention over the last five decades. This study proposes an iterated greedy heuristic for non-permutation flowshop scheduling problems. To validate and verify the proposed heuristic, computational experiments have been conducted on a well-known benchmark problem set, and the results are compared with 20 simple constructive heuristics and a state-of-the-art meta-heuristic performed on the same benchmark instances. In terms of both solution quality and computational expense, this study successfully develops an efficient and effective approach for non-permutation flowshop scheduling problems.