.png){kind=icon}
返回
Processing games with restricted capacities
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2009.06.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper analyzes processing problems and related cooperative games. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. The main feature of the model is a capacity restriction, i.e., there is a maximum amount of effort per time unit available for handling jobs. There are no other restrictions whatsoever on the processing schedule. Assigning to each job a player and letting each player have an individual capacity for handling jobs, each coalition of cooperating players in fact faces a processing problem with the coalitional capacity being the sum of the individual capacities of the members. The corresponding processing game summarizes the minimal joint costs for every coalition. It turns out that processing games are totally balanced. The proof of this statement is constructive and provides a core element in polynomial time. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Individual capacity
Cooperation
Core allocation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
7.1W
机构
引用论文
.png){kind=icon}
Third-order exceptional point and successive switching among three states in an optical microcavity光学微腔中三阶异常点和三个状态之间的连续切换OAAI
OAAI分享收藏 没有更多内容
没有更多内容