This summer I will be studying the problem of metric distances between permutations.

I will be programming various algorithms that find the distance between permutations.

These algorithms include *precedence metric, adjacency metric, swap metric*
and

*position-based* metric. After determining the permutation
distances, I will use these

distances to determine whether or not there exists any correlations between various

solutions. I will also compare the results of the metric algorithms to see which produce

the best job-shop schedules.