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 …

Improving the resilience of water distribution systems (WDSs) to handle natural disasters
(eg, earthquakes) is a critical step toward sustainable urban water management. This …

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 …

This paper presents a review of single machine scheduling to minimize the weighted
number of tardy jobs. The problem involves processing n jobs on a single machine, each …

Scheduling with multiple agents has been widely studied. However, a little work has been
done on multi-agent scheduling with availability constraints. This paper addresses a two …