graphs – topological sort with minimum maximal distance in array

I have a DAG that admits many possible topological sorts. I want to construct one that has the minimum maximum distance between a node and its neighbours in an array storing the nodes in sorted order.

Does this problem have a name that I can search (minimum maximum distance topological sort didn’t turn up anything)?

(If the problem is NP-Hard, a good heuristic will do too)

Thanks!