Modelling and Solving Rescheduling Problems in Dynamic Permutation Flow Shop Environments

Figure 5

Comparison of Pareto frontiers between the RIPG metaheuristic and the TP + PLS algorithm in a static, biobjective flow shop environment. (a) Problem instance ta001, (b) problem instance ta002, (c) problem instance ta018, (d) problem instance ta024, (e) problem instance ta031, (f) problem instance ta047, (g) problem instance ta084, and (h) problem instance ta100.

(a)

(b)

(c)

(d)

(e)

(f)

(g)

(h)