Loading...
On the Balancedness of M-Sequencing Games
Hamers,H.J.M. Klijn,F. Suijs,J.P.M.
Hamers,H.J.M.
Klijn,F.
Suijs,J.P.M.
Abstract
This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation, and m corresponds to the number of machines in the same m-sequencing situation. We prove that an m-sequening game is balanced if and only if the corresponding m-machine game is balanced. Furthermore, it is shown that m-sequencing games are balanced ifm 2 f1;2g. Finally, ifm 3, balancedness is established for two special classes of m-sequencing games.
Description
Pagination: 15
Date
1998
Journal Title
Journal ISSN
Volume Title
Publisher
Operations research
Files
Loading...
17.pdf
Adobe PDF, 107.83 KB
Research Projects
Organizational Units
Journal Issue
Keywords
cooperative games, sequencing situations, C71 - Cooperative Games
Citation
Hamers, H J M, Klijn, F & Suijs, J P M 1998 'On the Balancedness of M-Sequencing Games' CentER Discussion Paper, vol. 1998-17, Operations research, Tilburg.