Lets start with a simple case where we consider only two particles. Take a complete set of one particle state such that a basis of two particle states can be obtained as a product
$|k_{i}^{(1)}\rangle\bigotimes|k_{j}^{(2)}\rangle=|k_{i}^{(1)},k_{j}^{(2)}\rangle$
with the permutation operator that exchanges particles
$P=|k_{i}^{(1)},k_{j}^{(2)}\rangle=|k_{i}^{(2)},k_{j}^{(1)}\rangle$
Applying twice this operator we recover the original state, thus $P^{2}=1$. $P$ is showed to be hermitian considering any matrix element
$\langle u_{i}^{(1)},u_{j}^{(2)}|P|u_{i'}^{(1)},u_{j'}^{(2)}\rangle=\langle u_{i}^{(1)},u_{j}^{(2)}|u_{i'}^{(2)},u_{j'}^{(1)}\rangle=\delta_{ij'} \delta_{ji'}$
Since all the matrix elements are real you get $P^{\dagger}=P$. And since $P^{2}=1$ we also have $PP=P^{\dagger}P=1$, thus $P$ is unitary. This can be easily generalized for $N$ particles. This implies $S^{\dagger}=S$, that the operator is hermitian. This result is also true for the antisymmetrization operator. To convince yourself, take states that are eigenstates of all permutation operators in a system with $N$ particles. Index with $p$ the number of all possible $N!$ permutation and let $|\psi\rangle$ such that $P_{p}|\psi\rangle=c_{p}|\psi\rangle$. Its easily seen that the eigenvalue for a permutation should be $c_{p}=(\pm 1)^{n_p}$ where $n_{p}$ is the number of transpositions in which the $p$-th permutation can be splitted. Now you find two case, the totally symmetric and antisymmetric case. which leads you to the symmetrisation and antisymmetrisation operators.
EDIT:
For $N>2$ I generalize the case for two particles; construct a basis for the $N$-particles state as a product of one particle states
$|k_{i_1}^{(1)},\dots,k_{i_N}^{(N)}\rangle=|k_{i_1}^{(1)}\rangle\bigotimes\dots\bigotimes|k_{i_N}^{(N)}\rangle$
In general there are $N!$ possible permutations. A general permutation is denoted by
$P_{l_{1}\dots{l_N}}$ where $l_{j}=1\dots N$ and $j=1\dots N$
However, not to carry to many indices, I'll discuss the case for $N=3$. Obviously the are $6$ possible permutation $P_{123},P_{231},P_{312},P_{213},P_{321},P_{132}$. The permutation operators form a group since
- the product of two permutation operators is a permutation operator $P_{312}P_{213}=P_{132}$
- the identity is also a permutation operator. $P_{123}$ in this case
- the inverse of a permutation is also a permutation. $P_{231}^{-1}=P_{312}$, etc.
But, in general permutation do not commute. Here it can be seen that $P_{213}P_{312}=P_{321}\ne P_{132}$. As you know, a permutation where only two particles are permuted is called a transposition. For $N=3$ these are $P_{132}, P_{321},P_{213}$. As I've showed above for $N=2$ the transpositions are hermitian and unitary. Also, each permutation can be expressed as product of transpositions, $P_{312}=P_{132}P_{213}$. The parity of a permutation is given by the parity of the number of transpositions in which a permutation can be splitted. Since a permutation can be expressed as a product of transpositions and transpositions are unitary, permutations are unitary. But, as above, permutations do not commute in general, although transpositions are hermitian, a general permutation is not.
Now, with this lets pass to symmetrization and antisymmetrization operators. As stated in the last part of my comment before the edit we look for states that are eigenstates of all permutation operators in a system with $N$ particles. The states must satisfy $P_{p}|\psi\rangle=c_{p}|\psi\rangle$ ($p$ is the same as stated above before the edit). Now, the easiest case is that of a transposition, where $c_{p}^{transpose}=(\pm 1)^{n_{p}}$. Since $|\psi\rangle$ is assumed to be an eigenvector of all permutations, it should be an eigenvector of all transpositions. Also, if the particles are indistinguishable, the eigenvalue of the transposition cannot depend on the particular transposition, thus the eigenvalue should be the same for all transpositions. The eigenvalue for a permutation is then $c_{p}=(\pm 1)^{n_{p}}$. It is even or odd depending on the parity of the permutation. This gives us two cases
Total symmetric case $P_{p}|\psi_{S}\rangle=|\psi_{S}\rangle$, $c_{p}=1$
Total antisymmetric case $P_{p}|\psi_{A}\rangle=a_{p}|\psi_{A}\rangle$ where $a_{p}=\pm 1$ for odd and even permutations
Now, the totally symmetric and antisymmetric states spans a subspace of the total Hilbert space which we denote $\mathcal{H}_{S}$ and $\mathcal{H}_{A}$. Its easily proven that the states of these two subspaces are orthogonal to each other
$\langle\psi_{S}|\psi_{A}\rangle=\langle\psi_{S}|P_{p}^{\dagger}|\psi_{A}\rangle=\langle\psi_{S}|P_{p}^{-1}|\psi_{A}\rangle=-\langle\psi_{S}|\psi_{A}\rangle$
Here I assumed that the parity of $P_{p}^{-1}$ is odd. Finally, we build the projection operators on the subspaces $\mathcal{H}_{S}$ and $\mathcal{H}_{A}$ s.t. we obtain elements of either subspaces from any given states
$S=\frac{1}{N!}\sum_{p}P_{p}$ symmetrization op.
$A=\frac{1}{N!}\sum_{p}a_{p}P_{p}$ antisymmetrization op.
Since $P_{p}$ is unitary, $P^{\dagger}=P^{-1}$ is also a permutation operator. All of this, implies that $S^{\dagger}=S$ and $A^{\dagger}=A$, thus both operators are hermitian. Also, given a random permutation operator $P_{r}$ we find
$P_{r}S=\frac{1}{N!}\sum_{p}P_{r}P_{p}=\frac{1}{N!}\sum_{t}P_{t}=S$
with this you can show that $S^{2}=S$. This can help you in a more detailed proof. Hope this helps.