Thispaperdescribesanefficientalgorithmforsucharankingofalltheassignments.Themaximumcomputationaleffortrequiredtogenerateanadditionalassignmentinthesequenceisthatofsolvingatmost(n-i)differentassignmentproblems,oneeachofsizes2,3,...,n.