首页> 外文会议>International conference on modelling, identification and control >A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling
【24h】

A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling

机译:基于马尔可夫链的动态缓冲区预留方法解决调度中的死锁问题

获取原文

著录项

  • 来源
  • 会议地点 Tianjin(CN)
  • 作者单位

    Faculty of Information and Control Engineering Shenyang Jianzhu University Shenyang 110168 China Department of Digital Factory Shenyang Institute of Automation Chinese Academy of Sciences Shenyang 110016 China Key Laboratory of Network Control System Chinese Academy of Sciences Shenyang 110016 Liaoning China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang 110016 Liaoning China;

    Faculty of Information and Control Engineering Shenyang Jianzhu University Shenyang 110168 China;

    Department of Digital Factory Shenyang Institute of Automation Chinese Academy of Sciences Shenyang 110016 China Key Laboratory of Network Control System Chinese Academy of Sciences Shenyang 110016 Liaoning China;

  • 会议组织
  • 原文格式 PDF
  • 正文语种
  • 中图分类
  • 关键词

    Flexible flow shop; Reentrant process; Limited buffer; Deadlock situation; Markov Chain;

    机译:灵活的流动车间;重入过程;缓冲区有限;僵局情况;马尔可夫链;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号