Most classical scheduling research assumes that the objectives sought are common to all
jobs to be scheduled. However, many real-life applications can be modeled by considering …

Scheduling problems are combinatorial optimization problems in which some activities have
to be executed using resources that they need. A feasible allocation of the resources to the …

We consider a scheduling environment with m (m≥ 1) identical machines in parallel and
two agents. Agent A is responsible for n 1 jobs and has a given objective function with …

Scheduling with learning effects has received a lot of research attention lately. By learning
effect, we mean that job processing times can be shortened through the repeated …

We consider integrated production and batch delivery scheduling in a make-to-order
production system involving two competing agents, each of which having its own job set …

In this paper, we develop branch-and-bound algorithms for several hard, two-agent
scheduling problems, ie, problems in which each agent has an objective function which …

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 …

We consider the competitive multi-agent scheduling problem on a single machine, where
each agent's cost function is to minimize its total weighted late work. The aim is to find the …

We study a single machine scheduling problem, where two agents compete on the use of a
single processor. Each of the agents needs to process a set of jobs in order to optimize his …

We consider a scheduling environment with two agents and a linear non-increasing
deterioration. By the linear non-increasing deterioration we mean that the actual processing …