Dynamic scheduling algorithms are gaining more and more special attention for their satisfying robustness when confronted with unexpected events as well as their considerably high performance in scheduling. The wasp colony algorithm is a newly presented dynamic scheduling algorithm, which bases on natural insect society behavior models. Based on the principle of the wasp colony algorithm, two different algorithms, namely the routing wasp algorithm and the scheduling wasp algorithm, are combined to solve the job shop dynamic scheduling problem. The algorithms are modified to better adapt to job shop dynamic scheduling environment. The algorithms are developed based on Eclipse 3.2 and J2SE 6.0. Simulation experiments are accomplished and experimental data are analyzed. The results show that the principle of the algorithms is simple, their computational quantity is small, and they can be applied to multi-batch dynamic scheduling with unpredictable entry time due to their favorable potential.