We investigate the assignment of assets to tasks where each asset can potentially execute any of the tasks, but assets execute tasks with a probabilistic outcome of success. There is a cost associated with each possible assignment of an asset to a task, and if a task is not executed there is also a cost associated with the non-execution of the task. As we proposed in [Gelenbe, E., Timotheou, S., and Nicholson, D. (2010). Fast distributed near optimum assignment of assets to tasks. Comput. J., doi:10.1093/comjnl/bxq010], we formulate the allocation of assets to tasks in order to minimize the overall expected cost, as a nonlinear combinatorial optimization problem. We propose the use of network flow algorithms which are based on solving a seq...
Assignment Problem is a cornerstone in operations research. In the assignment problem, a set of supp...
Many decision problems in Operations Research are defined on temporal networks, that is, workflows o...
A distributed system comprising networked heterogeneous processors requires an efficient tasks-to-pr...
In this thesis we introduce new models and learning algorithms for the Random Neural Network (RNN), ...
The paper presents a minimum-cost flow approach for dynamic assignment procedures for networks ...
In many applications of parallel computing, distribution of the data unambiguously implies distribu...
We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm ...
This paper studies task assignment in a network of resource con-strained computing platforms (called...
The generalized assignment problem (GAP) is an open problem in which an integer k is given and one w...
Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Autho...
Abstract—This paper studies task migration in a network of resource constrained servers (called micr...
The Quadratic Assignment Problem (QAP) was introduced by Koopmans and Beckmann in 1957 as a mathemat...
Resource allocation and scheduling problems arise in several important technological fields such as ...
In many applications of parallel computing, distribution of the data unambiguously implies distribu...
A distributed algorithm is presented, for allocating a large number of identical resources (such as ...
Assignment Problem is a cornerstone in operations research. In the assignment problem, a set of supp...
Many decision problems in Operations Research are defined on temporal networks, that is, workflows o...
A distributed system comprising networked heterogeneous processors requires an efficient tasks-to-pr...
In this thesis we introduce new models and learning algorithms for the Random Neural Network (RNN), ...
The paper presents a minimum-cost flow approach for dynamic assignment procedures for networks ...
In many applications of parallel computing, distribution of the data unambiguously implies distribu...
We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm ...
This paper studies task assignment in a network of resource con-strained computing platforms (called...
The generalized assignment problem (GAP) is an open problem in which an integer k is given and one w...
Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Autho...
Abstract—This paper studies task migration in a network of resource constrained servers (called micr...
The Quadratic Assignment Problem (QAP) was introduced by Koopmans and Beckmann in 1957 as a mathemat...
Resource allocation and scheduling problems arise in several important technological fields such as ...
In many applications of parallel computing, distribution of the data unambiguously implies distribu...
A distributed algorithm is presented, for allocating a large number of identical resources (such as ...
Assignment Problem is a cornerstone in operations research. In the assignment problem, a set of supp...
Many decision problems in Operations Research are defined on temporal networks, that is, workflows o...
A distributed system comprising networked heterogeneous processors requires an efficient tasks-to-pr...