| 一种柔性车间快速启发式调度算法 |
| |
| 引用本文： | 邵斌彬,蔡鸿明,姜丽红. 一种柔性车间快速启发式调度算法[J]. 计算机应用与软件, 2009, 26(3) |
| |
| 作者姓名： | 邵斌彬 蔡鸿明 姜丽红 |
| |
| 作者单位： | 上海交通大学软件学院,上海,200240;上海交通大学软件学院,上海,200240;上海交通大学软件学院,上海,200240 |
| |
| 基金项目： | 国家自然科学基金,航空科学基金 |
| |
| 摘 要： | 柔性作业车间调度问题比传统的Job-shop问题更复杂也更符合实际生产实际.为了快速有效地求解这类问题,设计出一种基于综合分派规则的快速启发式调度算法.基于综合分派规则的调度算法,以一批工件总完工时间最短为目标,在调度过程中通过动态调整工件的加工优先级并为每道工序分配最适合的机器进行加工,可迅速求得满意的较优解.与其他方法进行对比实验结果证实了算法的有效性,在实际调度系统的应用中也证明了算法的实用性.
|
| 关 键 词： | 柔性作业车间 调度优化 启发式算法 综合分派规则 |
A FAST HEURISTIC ALGORITHM FOR SOLVING FJSP |
| |
| SHAO Binbin,CAI Hongming,JIANG Lihong. A FAST HEURISTIC ALGORITHM FOR SOLVING FJSP[J]. Computer Applications and Software, 2009, 26(3) |
| |
| Authors: | SHAO Binbin CAI Hongming JIANG Lihong |
| |
| Affiliation: | School of Software;Shanghai Jiaotong University;Shanghai 200240;China |
| |
| Abstract: | 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.Con... |
| |
| Keywords: | Flexible Job-shop Scheduling optimization Heuristic algorithm Integrated dispatching rules |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
