面向云制造的有限资源多任务调度博弈
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP391.7

基金项目:

国家科技支撑计划资助项目(2015BAF02B02);教育部创新团队发展计划资助项目(IRT_15R64)。


Multi-task scheduling game with limited resources for cloud manufacturing
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为解决云制造环境下云服务组合优化调度问题,在深入分析目前优化调度问题存在的难点及研究不足的基础上,提出一种云制造环境下有限资源的多任务调度模型。考虑服务需求者间存在的利益冲突及重要的服务评价指标,以每个服务需求者作为博弈参与者,将每个任务的执行制造路径当作博弈策略,把时间、合格率、成本和服务质量组成的综合服务水平看作博弈支付函数,最终把有限资源的多任务调度问题转变为多个静态非合作博弈问题。在此基础上,将求解纯策略纳什均衡解的过程编制为算法,该算法所得的均衡解为每个任务的最终执行制造路径。实验仿真表明该模型及算法具有可行性及有效性。

    Abstract:

    To solve the cloud service composition optimal-selection (CSCOS) problem in cloud manufacturing (CMfg), based on the deep analysis of the difficulties and shortcomings in current researches, an optimization model for multi-task scheduling with limited resources problem (MLSR) is proposed. Considering the interest conflicts of service demanders and important quality of service (QoS) indicators, the multi-task scheduling problem with limited resources is converted into multiple static non-cooperative game, and the service demander (SD), different execution manufacturing path of each task and comprehensive service level (CSL) are considered as game player, game strategy and game payoff of a game, respectively. On this basis, the process to seek the pure strategy Nash Equilibrium (PSNE) solution is compiled into an algorithm, whose solutions are the final manufacturing execution paths for each task. Finally, simulation results show the feasibility, effectiveness of both the model and algorithm.

    参考文献
    相似文献
    引证文献
引用本文

舒萧,王时龙,康玲,杨波,杨星星,邹海旭.面向云制造的有限资源多任务调度博弈[J].重庆大学学报,2020,43(3):1-11.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2019-03-31
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2020-03-31
  • 出版日期:
文章二维码