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 …

Previous work on assigning tasks to robots has proposed extensive categorizations of
allocation of tasks with and without constraints. The main contribution of this paper is a …

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 …

Subset Sumand k-SAT are two of the most extensively studied problems in computer
science, and conjectures about their hardness are among the cornerstones of fine-grained …

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 consider a multitasking scheduling model with multiple agents, each of which has a set
of tasks to perform on a cloud manufacturing platform on a competitive basis. Each agent …

Competitive scheduling problems occur in integrated-services packet-switched networks, in
which different applications compete for the same resource. Requests of each application …

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 …