In this connection, this paper proposes a Deep Q-Network (DQN) approach to address the dynamic nature of the job-shop scheduling problem. Dynamic scheduling requires an efficient and reliable algorithm for handling disruptions such as machine breakdowns and job priority changes. When comparing DQN with traditional approaches such as genetic algorithm (GA) and PSO, the latter algorithms cannot cope with the problems. On the contrary, DQN gains knowledge from its experiences within the factory and develops a strategy for solving the scheduling problem through minimizing makespan and maximizing machine utilization. Moreover, using experience replay (ER) and target networks enables DQN to maintain stability and develop an optimal schedule. Empirically, it was found that DQN reduces makespan by 24.8% with machine utilization being 92%. From the results obtained, it can be noted that the learning parameters play a great role in determining the performance of the model. Thus, this study proves that DQN is an effective approach for addressing the issue under discussion and could also be used for developing other approaches such as multi-agent and double DQN.