.png){kind=icon}
.png){kind=icon}
Return
Processing games with shared interest
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-007-0235-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
processing games
scheduling
core allocation
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W