| 基于极大代数的阻塞流水车间启发式动态规划调度算法 |
| |
| 引用本文： | 李彦平,王帅,赵月. 基于极大代数的阻塞流水车间启发式动态规划调度算法[J]. 沈阳大学学报：自然科学版, 2013, 25(1): 45-49 |
| |
| 作者姓名： | 李彦平 王帅 赵月 |
| |
| 作者单位： | 沈阳大学科学技术研究中心,辽宁沈阳,110044 |
| |
| 摘 要： | 基于极大代数理论,引入任务排序函数与时间D子集,建立阻塞流水车间排序与调度代数模型,并提出启发式动态规划调度算法,实例计算表明算法十分有效.
|
| 关 键 词： | 阻塞流水车间 任务调度 极大代数 排序函数 启发式动态规划算法 |
Heuristic Dynamic Programming Scheduling Algorithm of Blocking Flow-shop Based on Max-algebra Theory |
| |
| Li Yanping , Wang Shuai , Zhao Yue. Heuristic Dynamic Programming Scheduling Algorithm of Blocking Flow-shop Based on Max-algebra Theory[J]. Journal of Shenyang University, 2013, 25(1): 45-49 |
| |
| Authors: | Li Yanping Wang Shuai Zhao Yue |
| |
| Affiliation: | (Research Center of Science and Technology, Shenyang University, Shenyang 110044, China) |
| |
| Abstract: | Based on the Max-algebra theory, the task sequence {unction and time D-subsets are introduced, the blocking flow shop scheduling is established as well as the scheduling algebra model. The heuristic dynamic programming algorithm is proposed and conformed very effective. |
| |
| Keywords: | blocking flow shop task scheduling Max-algebra sequence {unction heuristic dynamic programming algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
