Jobshop调度问题是一类具有很高理论研究和工程应用价值的问题。针对该问题提出一种新型萤火虫求解算法,分析了萤火虫算法的仿生原理,给出了萤火虫算法求解JSP问题的求解步骤,并通过典型基准测试实例对算法进行了仿真实验,并与GA和PSO算法进行了比较,验证了该算法参数少,操作简单,收敛速度快,在生产调度中有广泛的应用前景。
Job-shop scheduling problem is a problem with high research and engineering application value. The paper presents a new novel algorithm (firefly algorithm) for solving job-shop scheduling problem and analyzes the bionic principle, then lists the solving steps using FA. Compared with GA and PSO, the simulation results for benchmark instances verify that firefly algorithm shows merits of fewer parameters, simple operation and fast convergence.