Scheduling in computing is the rearrangement of machine instructions to obtain the optimal level services subject to various constraints. The scheduling activity is controlled by a scheduler (part of the Operating Systems that initiates and stops the computer programs). This study proposes a dynamic scheduling optimization model (DSOM) that handles unexpected machine breakages and balances the workload amongst the available machines at optimal time and make span. The model mimics the multiprocessor scheduling theory that is formulated as a blocking parallel-machine job shop scheduling (BPMJSS) problem. In the developed model, any unexpected machine failure during load balancing is detectable and available machines are considered for