Abstract: A dynamic job shop scheduling problem with operation relativity and job releasing in batch are proposed. Based on defining operation relativity and giving its mathematical description systematically, the optimization model of the dy-namic job shop scheduling is put forward. A new combinatorial dispatching rule, RAN(FCFS,ODD), and a heuristic method are designed. In order to validate the method and compare and evaluate the new combinatorial dispatching rule, a simulation method is presented, then seven dispatching rules proposed in literatures and RAN(FCFS,ODD) are adopted in scheduling simulation. Simulation results indicate that the heuristic method is effective and RAN(FCFS,ODD) outperforms the other seven dispatching rules with respect to the dynamic job shop scheduling problem proposed.

Key words: Dispatching rules Simulation, Heuristic method, Dynamic job shop scheduling, Operation relativity