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

Clc Number:

TP391.7

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

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

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 31,2019
  • Revised:
  • Adopted:
  • Online: March 31,2020
  • Published:
Article QR Code