The paper 'Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs' by Uno gives an algorithm for this that is O(n) time per matching.
In general, the time complexity of finding all maximum matchings in a profile of n items in a bipartite network is O(V E) or O(radical V E), depending on the approach used.