This paper analyzes processing problems and related cooperative games. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. There are no restrictions whatsoever on the processing...

The main result of this paper is the convexity of Step out - Step in (SoSi) sequencing games, a class of relaxed sequencing games first analyzed by Musegaas, Borm, and Quant (2015). The proof makes use of a polynomial time algorithm determining the value and an optimal processing order for an...

A generalization of processing problems with restricted capacities is introduced. In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times. The new aspect is that players have interest...

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output. Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...