This paper considers one-machine sequencing situations in which agents are in a ed 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...

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

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