We study online task assignment problem with reusable resources, motivated by practical applications such as ridesharing, crowdsourcing and job hiring. In the problem, we are given a set of offline vertices (agents), and, at each time, an vertex (task) arrives randomly according to known time-dependent distribution. Upon arrival, assign agents immediately irrevocably. The goal is maximize expec...

In the field of cooperative robotics, task allocation is an issue receiving much attention. When researchers design, build, and use cooperative multi-robot system, they invariably try to answer the question of which robot should execute which task. This is in fact a multirobot task allocation problem (MRTA). The task allocation problem addresses the question of finding the task-to-robot assignm...

In this paper, we present and discuss the task assignment problem for distributed systems. We also show how this problem is very similar to that of clustering transactions for load balancing purposes and for their efficient execution in a distributed environment. The formalization of these problems in terms of a graph-theoretic representation of a distributed program, or of a set of related tra...

We consider the problem of scheduling m periodic tasks on n; n < m; identical processors. Our main contribution is to show that the condition n, where is the total density of the task set, is a suucient condition for scheduling the m tasks such that no deadlines are ever missed. We start with a novel representation of the periodic task scheduling problem as a maximum network ow problem. The str...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...