Generations of permutations with non-unique elements

We wish to generate all unique permutations of a list of elements with possibly repeated items. We develop four algorithms to generate permutations, two from Knuth's Art of Computer Programming and two of our own devising. The last one developed also gives a numbering scheme for permutations that can be inverted to regenerate original permutations.