Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483324 | European Journal of Operational Research | 2006 | 6 Pages |
Abstract
We study m-sequencing games, which were introduced by [Hamers, H., Klijn, F., Suijs, J., (1999). On the balancedness of multiple machine sequencing games. European Journal of Operational Research 119, 678–691]. We answer the open question whether all these games are balanced in the negative. We do so, by an example of a 3-sequencing situation with 5 jobs, whose associated 3-sequencing game has an empty core. The counterexample finds its basis in an inconsistency in [Hamers et al., ibid], which was probably overlooked by the authors. This observation demands for a detailed reconsideration of their proofs.1
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Marco Slikker,