面向Jobshop调度的时间映射算法  

Time Mapping Algorithm for Jobshop Scheduling

作　　者：黄学文[1] 史青涛 赵兴野[1] 

机构地区：[1]大连理工大学管理与经济学部

出　　处：《工业工程》2014年第4期35-41,共7页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(70772086);国家科技支撑计划资助项目(2013BAF02B03)

摘　　要：现实的Jobshop生产环境中的生产日历和班次等把设备资源的有效工作时间段分割成离散状态。为了降低调度在确定工序开始和结束时间时的计算复杂性,提出了一种时间映射算法。通过该算法实现了离散作业时间到整数连续区间和整数连续区间到离散作业时间的快速转换;并以遗传调度算法为例,研究了时间映射算法与调度算法的融合技术,实现了在连续整数区间上的调度。研究结果表明,相比未采用时间映射算法的调度算法,采用时间映射算法能大幅降低调度在确定工序开始和结束时间上的计算复杂性,计算时间降幅达到39.7%,从而提高了调度的计算效率。The work calendar and shift in realistic jobshop production environment split the effective work time of machine into a discrete state. In order to reduce the computational complexity of allocating the start and end time of a process, a time mapping algorithm （TMA） is proposed. The quick switch from discrete time spans to integral continuous intervals and from integral continuous intervals to discrete time spans is realized by the algorithm. Taking genetic algorithm （GA） scheduling as an example, the technology of how to integrate this algorithm with scheduling algorithms is also analyzed. The analysis illustrates that, compared with the scheduling algorithm without TMA, TMA can dramatically reduce the computational complexity of scheduling on allocating the start and end time of a process. By the algorithm, calculation time is reduced by 39.7% and the efficiency of scheduling is improved.

关 键 词：Jobshop调度 时间映射算法 生产日历 

分 类 号：TH186[机械工程—机械制造及自动化]