Abstract
Two classes of one machine sequencing situations are considered in which each job corresponds to exactly one player but a player may have more than one job to be processed, so called RP(repeated player) sequencing situations. In max-RP sequencing situations it is assumed that each player’s cost function is linear with respect to the maximum completion time of his jobs, whereas in min-RP sequencing situations the cost functions are linear with respect to the minimum completion times. For both classes, following explicit procedures to go from the initial processing order to an optimal order for the coalition of all players, equal gain splitting rules are defined. It is shown that these rules lead to core elements of the associated RP sequencing games. Moreover, it is seen that min-RP sequencing games are convex.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bondareva, O. N. (1963). Some applications of linear programming methods to the theory of cooperative games. Problemy Kibernitiki, 10, 119–139 (in Russian).
Calleja, P., Estévez-Fernández, A., Borm, P., & Hamers, H. (2006). Job scheduling, cooperation and control. OR Letters, 34, 22–28.
Curiel, I., Pederzoli, G., & Tijs, S. (1989). Sequencing games. European Journal of Operational Research, 40, 344–351.
Curiel, I., Hamers, H., & Klijn, F. (2002). Sequencing games: a survey. In P. Borm & H. Peters (Eds.), Chapters in game theory: honor of Stef Tijs (pp. 27–50). Boston: Kluwer Academic.
Shapley, L. S. (1967). On balanced sets and cores. Naval Research Logistics Quarterly, 14, 453–460.
Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11–26.
Smith, W. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59–66.
Sprumont, Y. (1990). Population monotonic allocation schemes for cooperative games with transferable utility. Games and Economic Behavior, 2, 378–394.
Author information
Authors and Affiliations
Corresponding author
Additional information
We thank two referees for their valuable suggestions for improvement.
Financial support for P. Calleja has been given by the Ministerio de Educación y Ciencia and FEDER under grant SEJ2005-02443/ECON, and by the Generalitat de Catalunya through a BE grant from AGAUR and grant 2005SGR00984.
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
Estévez-Fernández, A., Borm, P., Calleja, P. et al. Sequencing games with repeated players. Ann Oper Res 158, 189–203 (2008). https://doi.org/10.1007/s10479-007-0237-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0237-6