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

We consider scheduling problems involving two agents (agents A and B), each having a set
of jobs that compete for the use of a common machine to process their respective jobs. The …

We consider the scheduling problems arising when two agents, each with a family of jobs,
compete to perform their respective jobs on a common unbounded parallel-batching …

We consider several two-agent scheduling problems with assignable due dates on a single
machine, where each of the agents wants to minimize a measure depending on the …

In this paper we study two-agent scheduling in a two-machine flowshop. The cost function is
the weighted sum of some common regular functions, including the makespan and the total …

We consider several two-agent single-machine scheduling problems with deteriorating jobs.
By deteriorating jobs we mean that the actual processing time of any job of the two agents is …

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 …