Seven little men

This is just like this problem, but the difference is the dwarves are distinguishable, while the letters in GOOFING are not. Therefore, we need to multiply the answer by $4$ . (Two for each set of distinguishable dwarves with the same initial letter in their name). Therefore the answer is $4*230 = \boxed{920}$

While I'm sure there is a way to do this without programming, I'm not sure there is a simpler way to do this without programming. (The only method I can think of is a massive case-by-case proof.) So:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

import itertools
count = 0 # our final result
# try every possible permutation; double-counts identical things, but we do want it, because the two D's and two S's are distinguishable
for perm in itertools.permutations("DSBDSGH"):
    for i in range(7):
        if perm[i] == "DSBDSGH"[i]: break # if a dwarf stands on its initial, continue with next iteration
    else: # no dwarf stands on its initial, increment count
        count += 1
print(count)
# prints 920