The disorder of a permutation.
Consider a permutation $\pi = [\pi_1,\ldots,\pi_n]$ and cyclically scanning $\pi$ from left to right and remove the elements $1$ through $n$ on this order one after the other. The disorder of $\pi$ is defined to be the number of times a position was not removed in this process.
For example, the disorder of $[3,5,2,1,4]$ is $8$ since on the first scan, 3,5,2 and 4 are not removed, on the second, 3,5 and 4, and on the third and last scan, 5 is once again not removed.

Sents a permutation to its complement.
The complement of a permutation $\sigma$ of length $n$ is the permutation $\tau$ with $\tau(i) = n+1-\sigma(i)$

Sends a Dyck path to the 312-avoiding permutation according to Bandlow-Killpatrick.
This map is defined in [1] and sends the area (St000012The area of a Dyck path.) to the inversion number (St000018The number of inversions of a permutation.).

Return the reversal of the permutation obtained by inverting the corresponding Laguerre heap.
This map is the composite of Mp00241invert Laguerre heap and Mp00064reverse.
Conjecturally, it is also the rowmotion on the weak order:
Any semidistributive lattice $L$ has a canonical labeling of the edges of its Hasse diagram by its join irreducible elements (see [1] and [2]). Rowmotion on this lattice is the bijection which takes an element $x \in L$ with a given set of down-labels to the unique element $y \in L$ which has that set as its up-labels (see [2] and [3]). For example, if the lattice is the distributive lattice $J(P)$ of order ideals of a finite poset $P$, then this reduces to ordinary rowmotion on the order ideals of $P$.
The weak order (a.k.a. permutohedral order) on the permutations in $S_n$ is a semidistributive lattice. In this way, we obtain an action of rowmotion on the set of permutations in $S_n$.
Note that the dynamics of weak order rowmotion is poorly understood. A collection of nontrivial homomesies is described in Corollary 6.14 of [4].