Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem
Citations
13,333 citations
248 citations
211 citations
Cites methods from "Genetic algorithms with path relink..."
...Inspired by the generational schemes of Ruiz et al. (2006) and Vallada and Ruiz (2010), pn is included into H if and only if: 1) The makespan of pn is better than the makespan of the worst solution in set H and 2) It is unique, i.e., there are no other identical solutions in set H....
[...]
191 citations
179 citations
References
13,333 citations
"Genetic algorithms with path relink..." refers methods in this paper
...First, we check the three main hypotheses of ANOVA: normality, homocedasticity and independence of the residuals (Montgomery, 2000)....
[...]
10,382 citations
[...]
6,373 citations
6,209 citations
"Genetic algorithms with path relink..." refers background in this paper
...According to Pinedo (2008) this problem is denoted as F/prmu/Cmax and the associated decision problem was shown to be NP-complete by Rinnooy Kan (1976) for m ≥ 3....
[...]
...Therefore, the PFSP with this criterion is denoted as F/prmu/ ∑ Tj (Pinedo, 2008) where Tj = max{Cj − dj, 0} is the tardiness of job j, being dj its due date and Cj its completion time at the last machine of the shop....
[...]
4,751 citations
"Genetic algorithms with path relink..." refers methods in this paper
...Path relinking is a search technique originally proposed by Glover and Laguna (1997) where the objective is to explore the search space or path between a given set (usually two) of good solutions....
[...]
...More speci cally, we apply the Friedman test (Friedman, 1937) according to Conover (1999) to compute the Minimal Signi cant Di erence (MSD) between the rank means of any two algorithms....
[...]