.png){kind=icon}
返回
Processing games with shared interest
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-007-0235-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces processing problems with shared interest as an extension of processing situations with restricted capacities (Meertens, M., et al., Processing games with restricted capacities, 2004). Next to an individual capacity to handle jobs, each player now may have interest in the completion of more than one job, and the degrees of interest may vary among players. By cooperating the players can bundle their capacities and follow an optimal processing scheme to minimize total joint costs. The resulting cost allocation problem is analyzed by considering an associated cooperative cost game. An explicit core allocation of this game is provided.
Keyword:
processing games
scheduling
core allocation
期刊
IF:
4.5
论文数:
8.2K
被引数:
2.3W
机构
引用论文
Synthesis of Spiro[cycloalkane-pyridazinones] with High Fsp3 Character高fsp3特性的螺环烷基-吡啶二嗪酮类化合物的合成
.png){kind=icon}
PREAI
分享收藏Crystal structure of 2,5-bis((E)-2-(trifluoromethyl)benzylidene)cyclopentan-1-one, C21H14F6O2,5-双((E)-2-(三氟甲基)苄叉)环戊烷-1-酮的晶体结构，C21H14F6O
OAAI
OAAI分享收藏