检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江工业大学机械工程学院,浙江杭州310014
出 处:《轻工机械》2014年第3期90-94,99,共6页Light Industry Machinery
基 金:国家自然科学基金(70971118);浙江省自然科学基金(LY12E05021)
摘 要:为了解决加工装配车间的资源冲突问题,提出了基于面向对象时间约束Petri网的加工装配车间资源可调度性判定方法。该方法给出了面向对象时间约束Petri网的语义描述和可调度性定义,建立了基于面向对象时间约束Petri网的加工装配车间的建模方法,提出了基于加工装配车间各资源生产的最早触发开始时间和最晚触发结束时间的车间可调度性判定依据与判定步骤,并给出了资源不可调度时的改进方法。给出了应用实例,验证了所提出的判定方法的有效性。To solve the resource conflict problem of processing and assembly workshop, a process-assembly workshop resource schedulability method based on Oriented Object Timing Constraint Petri Nets (OOTCPN'S) was proposed. The semantic description and schedulability definition of OOTCPN'S were presented, and the modeling method of processassembly workshop based on OOTCPN'S was established. The judgment basis and step of workshop schedulability based on earliest fire beginning time and latest fire ending time of processing assembly workshop resource were put proposed, and a improved method was put forward when resource was not sehedulable. Finally, the effectiveness verification of judgment method was discussed in detail.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43