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.
To Search:
File list (Check if you may need any files):
ACO on JSSP
...........\ACO.m
...........\dinamicjssp.asv
...........\dinamicjssp.m
...........\dinamicjssp2.m
...........\dinamicjssp3.m
...........\inputstream.m
...........\job01.xls
...........\job02.xls
...........\makespan.m
...........\nodeexchange.m
...........\pheromone.m
...........\screenshoot.JPG
...........\setmachine.m
...........\setuptime.m
...........\showmap.m
...........\test01.xls
Download