基于极大代数的阻塞流水车间启发式动态规划调度算法  

Heuristic Dynamic Programming Scheduling Algorithm of Blocking Flow-shop Based on Max-algebra Theory

作　　者：李彦平[1] 王帅[1] 赵月[1] 

机构地区：[1]沈阳大学科学技术研究中心,辽宁沈阳110044

出　　处：《沈阳大学学报（自然科学版）》2013年第1期45-49,共5页Journal of Shenyang University：Natural Science

摘　　要：基于极大代数理论,引入任务排序函数与时间D子集,建立阻塞流水车间排序与调度代数模型,并提出启发式动态规划调度算法,实例计算表明算法十分有效.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.

关 键 词：阻塞流水车间 任务调度 极大代数 排序函数 启发式动态规划算法 

分 类 号：TP311.131[自动化与计算机技术—计算机软件与理论]