Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Calleja, P., Estévez-Fernández, A., Borm, P., & Hamers, H. (2004). Job scheduling, cooperation and control. CentER DP 2004-65, Tilburg University, Tilburg, The Netherlands.
Curiel, I., Pederzoli, G., & Tijs, S. (1989). Sequencing games. European Journal of Operational Research, 40, 344–351.
Estévez-Fernández, A., Borm, P., Calleja, P., & Hamers, H. (2004). Sequencing games with repeated players. CentER DP 2004-128, Tilburg University, Tilburg, The Netherlands.
Meertens, M., Borm, P., Quant, M., & Reijnierse, H. (2004). Processing games with restricted capacities. CentER DP 2004-83, Tilburg University, Tilburg, The Netherlands.
Smith, W. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59–66.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Quant, M., Meertens, M. & Reijnierse, H. Processing games with shared interest. Ann Oper Res 158, 219–228 (2008). https://doi.org/10.1007/s10479-007-0235-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0235-8