On a new class of parallel sequencing situations and related games

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine. The costs of an agent depend linearly on the final completion time of his jobs. We describe a procedure that provides an optimal processing order of the jobs for some particular classes. Furthermore, we study cooperative games arising from these sequencing situations. Our main result will be on the balancedness of these games