中文说明：动态作业车间调度问题是车间的一种形式作业调度与不同的抵达时间作业或不并发的问题。此问题可以表示在图的形式，是寻求从起始点到目标点的最短路径。可以使用的一个解决方案是与蚁群优化算法。有三个方法来输入作业： xls 文件、 matriks 和 atrractive 对话框的
English Description：
Dynamic job shop scheduling problem is one form of a job shop scheduling problem with varying arrival time job or not concurrent. This problem can be represented in graph form, which is to seek the shortest path from start point to destination point. One solution that can be used is with the ant colony optimization algorithm. There are three method to input the job : xls file, matriks, and atrractive dialog