The research that studies the interaction between sequencing situations and cooperative games, that started with the paper of Curiel et al. (1989), has become an established line of research. This paper introduces a new model in this field: partitioning sequencing situations and games. The characteristic of partitioning sequencing situations is that the jobs arrive in batches, and those jobs that arrive in earlier batches have some privileges over jobs in later arrived batches. For partitioning sequencing situations we introduce and characterise the partitioning equal gain splitting rule. Next, we define cooperative games that arise from these partitioning sequencing situations. It is shown that these games are convex. Moreover, we present a game independent expression for the Shapley value. Finally, it is shown that the partitioning equal gain splitting rule can be used to generate a core allocation and can be viewed as the average of two specific marginal vectors.
