Additive Manufacturing (AM) has revolutionized the production landscape by enabling on-demand customized manufacturing. However, the efficient management of dynamic AM orders poses significant challenges for production planning and scheduling. This paper addresses the dynamic scheduling problem considering batch processing, random order arrival and machine eligibility constraints, aiming to minimize total tardiness in a parallel non-identical AM machine environment. To tackle this problem, we propose the out-of-order enabled dueling deep Q network (O3-DDQN) approach. In the proposed approach, the problem is formulated as a Markov decision process (MDP). Three-dimensional features, encompassing dynamic orders, AM machines, and delays, are extracted using a ‘look around’ method to represent the production status at a rescheduling point. Additionally, five novel composite scheduling rules based on the out-of-order principle are introduced for selection when an AM machine completes processing or a new order arrives. Moreover, we design a reward function that is strongly correlated with the objective to evaluate the agent's chosen action. Experimental results demonstrate the superiority of the O3-DDQN approach over single scheduling rules, randomly selected rules, and the classic DQN method. The average improvement rate of performance reaches 13.09% compared to composite scheduling rules and random rules. Additionally, the O3-DDQN outperforms the classic DQN agent with a 6.54% improvement rate. The O3-DDQN algorithm improves scheduling in dynamic AM environments, enhancing productivity and on-time delivery. This research contributes to advancing AM production and offers insights into efficient resource allocation.