In this paper, we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed. We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition. Furthermore,...

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...

This paper considers one-machine sequencing situations in which agents are in a fixed initial order before the processing of the machine starts. The agents are allowed to rearrange positions to save costs w.r.t. the costs given by the initial order. We will assume that the agents are not certain...