Sequencing games with controllable processing times

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 obtain two core elements that depend only on the optimal schedule for the grand coalition. Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.