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 …

We consider three‐agent scheduling on a single machine in which the criteria of the three
agents are to minimize the total weighted completion time, the weighted number of tardy …

We consider the Pareto-scheduling of two competing agents on a single machine, in which
the jobs of each agent have their “own equal processing times”(shortly, OEPT). In the …

This article studies a multi-agent scheduling problem on a set of m machines in a no-wait
flow shop system, where each agent's objective function is to maximize its own weighted …

Scheduling with two competing agents on a single machine has become a popular research
topic in recent years. Most research focuses on minimizing the objective function of one …

Two-agent scheduling has gained a lot of research attention recently. Two competing agents
who have their own objective functions have to perform their respective set of jobs on one or …

The challenge is to develop an easily usable protocol development framework that
combines the flexibility of layered implementations, the efficiency of tightly-coupled …

We consider a two-agent scheduling problem on parallel machines such that each task of
agent 2 has a given time window. Furthermore, we introduce a resource constraint under …

Different variants of the multi-agent scheduling have been studied in the literature due to its
wide applications in artificial intelligence, decision theory, operations research, etc. Most of …

In this paper we consider the problems of order pickers in warehouse management. We
interpret the problems as machine scheduling problems in which the due dates are not …