Modelling and Solving Rescheduling Problems in Dynamic Permutation Flow Shop Environments
Table 1
Classical parametrization for the RIPG algorithm.
Parameter
Default value
Size of the set of job solutions after the restart phase (working set)
100
k (number of consecutive elements eliminated in the greedy phase’s destruction operation).
5
nsel (number of elements selected randomly in the local search phase). Dynamic parameter dependent on the number of jobs in the instance to be solved.
nsel = ncount if ncount ≤ n 0.5, else nsel = n 0.5 n is the number of jobs and ncount is the number of times that a solution has been selected
nneigh (consecutive positions where a job is reinserted in the local search phase).
5
Restart threshold (maximum number of iterations allowed without modifying the size of the nondominated solutions set. Once this value is surpassed, the working set randomly restarts).
