How can the algorithm be improved so that it runs faster?

Question

Python

There is an algorithm for finding the next larger number in permutations of this number. But he's not fast enough.
How can it be improved?

The code

import itertools

def next_bigger(n):
    nlst = list(str(n))

    for i in range(len(nlst) - 1, -1, -1):
        tempLst1 = nlst[:i]
        tempLst2 = nlst[i:]

        vs = list(itertools.permutations(tempLst2, len(tempLst2)))

        temp = [int("".join(tempLst1 + list(x))) for x in vs if int("".join(tempLst1 + list(x))) > n]
        if len(temp) >= 1:
            return min(temp)