摘要
柔性作业车间调度问题比传统的Job-shop问题更复杂也更符合实际生产实际。为了快速有效地求解这类问题,设计出一种基于综合分派规则的快速启发式调度算法。基于综合分派规则的调度算法,以一批工件总完工时间最短为目标,在调度过程中通过动态调整工件的加工优先级并为每道工序分配最适合的机器进行加工,可迅速求得满意的较优解。与其他方法进行对比实验结果证实了算法的有效性,在实际调度系统的应用中也证明了算法的实用性。
Compared with classic Job -shop problem （JSP）, flexible Job-shop scheduling problem （FJSP） is more complex, and is also more compatible with the actual production environments. In order to quickly and efficiently solve FJSP, a fast heuristic scheduling algorithm based on integrated dispatching rules was designed. This scheduling algorithm has an objective to minimize the makespan, in the scheduling process, job processing priority is dynamically adjusted, and most appropriate machine is selected for each operation. Consequently, the algorithm can figure out preferable result in very short time. Computational results show that this algorithm is effective, with respect to other methods proposed by other authors. Moreover, the application in real scheduling system proves the practicality of this algorithm as well.
出处
《计算机应用与软件》
CSCD
2009年第3期32-34,共3页
Computer Applications and Software
基金
国家自然科学基金项目(60603080
70471024)
航空科学基金(2007ZG57012)
关键词
柔性作业车间
调度优化
启发式算法
综合分派规则
Flexible Job-shop Scheduling optimization Heuristic algorithm Integrated dispatching rules
