This paper surveys the research area of cooperative games associated with several types of
operations research problems in which various decision makers (players) are involved …

We consider the scheduling problems arising when two agents, each with a set of
nonpreemptive jobs, compete to perform their respective jobs on a common processing …

We consider the feasibility model of multi-agent scheduling on a single machine, where
each agent's objective function is to minimize the total weighted number of tardy jobs. We …

This paper introduces a new class of cooperative games arising from cooperative decision
making problems in a stochastic environment. Various examples of decision making …

We consider multi-agent scheduling on a single machine, where the objective functions of
the agents are of the max-form. For the feasibility model, we show that the problem can be …

A relatively new class of scheduling problems consists of multiple agents who compete on
the use of a common processor. We focus in this paper on a two-agent setting. Each of the …

This paper considers sequencing situations with due date criteria. Three different types of
criteria are considered: the weighted penalty criterion, the weighted tardiness criterion and …

The multiple-agent scheduling problems have received increasing attention recently.
However, most of the research focuses on deriving feasible/optimal solutions or examining …

Scheduling with multiple agents and learning effect has drawn much attention. In this paper,
we investigate the job scheduling problem of two agents competing for the usage of a …

Two agents, each having his own set of jobs, compete to perform their own jobs on a
common processing resource. Each job of the agents has a weight that specifies its …