Non-binary LDPC codes have interesting performances, especially for short to moderate blocklengths. The decoding schedule of these codes decoding, similarly to the binary case, has an important impact on the decoder's behaviour and should be carefully designed. This paper studies and optimizes the layered scheduling of non-binary LDPC codes following two approaches: A static approach, defining an optimized permanent scheduling for the decoder independently of its entries or state, and a dynamic approach adapting the scheduling on the fly following the decoder's convergence. These two approaches show either a reduction in the number of iterations of about 18% or a reduction in signal to noise ratio of about 0.05dB.