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. Platform: |
Size: 56320 |
Author:Bharath |
Hits:
Description: Considering the complete process of surgery including the
preoperative and postoperative stages, multiple resource constraints involved and
the integration of surgical upstream and downstream resources, surgery
scheduling was described as an extended multi-resource constrained flexible
job-shop scheduling problem and an optimization approach was proposed based
on an improved ant colony algorithm. A resource selection rule and strategy of
overtime judging and adjusting was designed, and the scheduling process with
the ant colony algorithm was realized. The case study shows that the improved
ant colony algorithm proposed in this paper achieved good results in shortening
total time and allocating resources for surgery scheduling Platform: |
Size: 247808 |
Author:yangs |
Hits:
Description: 一种群智能优化算法布谷鸟算法，用于车间调度，TSP问题以及VRP问题的优化等(A population intelligent optimization algorithm, the cuckoo algorithm, is used for job shop scheduling, TSP problem and optimization of VRP problems.) Platform: |
Size: 13312 |
Author:shangfanggu |
Hits:
Description: 利用蚁群算法解决车间调度问题，这种算法具有分布计算、信息正反馈和启发式搜索的特征，本质上是进化算法中的一种启发式全局优化算法(Using ant colony algorithm to solve job shop scheduling problem.This algorithm has the characteristics of distributed computing, positive information feedback and heuristic search. In essence, it is a heuristic global optimization algorithm in evolutionary algorithm) Platform: |
Size: 1024 |
Author:憧灵 |
Hits:
Search - optimization of job shop scheduling