Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Heuristic Algorithms for Task Assignment in Distributed Systems
IEEE Transactions on Computers
An efficient algorithm for a task allocation problem
Journal of the ACM (JACM)
On the task assignment problem: two new efficient heuristic algorithms
Journal of Parallel and Distributed Computing
A hybrid heuristic to solve a task allocation problem
Computers and Operations Research
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Proceedings of the 8th International Symposium on Parallel Processing
Task Assignment in Distributed Systems Using Network Flow Methods
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
A mechanism for pricing and resource allocation in peer-to-peer networks
Electronic Commerce Research and Applications
Task assignment in heterogeneous computing systems using an effective iterated greedy algorithm
Journal of Systems and Software
An adaptive multi-start graph partitioning algorithm for structuring cellular networks
Journal of Heuristics
Data-Mining-Driven Neighborhood Search
INFORMS Journal on Computing
Task allocation in distributed computing systems using adaptive particle swarm optimisation
International Journal of Computer Applications in Technology
INFORMS Journal on Computing
Hi-index | 0.01 |
The task allocation problem (TAP) is one where a number of tasks or modules need to be assigned to a set of processors or machines at minimum overall cost. The overall cost includes the communication cost between tasks that are assigned to different processors and other costs such as the assignment cost and the fixed cost of using processors. Processors may have limited or unlimited capacities to perform tasks. Task allocation has been applied to the design of distributed computing systems and also in auto-manufacturing contexts. We present several integer programs and a column generation formulation for the uncapacitated and the capacitated TAP. Computational experiments are carried out to demonstrate computational capabilities of integer programming and the column generation formulations for the uncapacitated TAP (UTAP). Excellent results are obtained for the column generation formulation. We also report some computational experience for the capacitated TAP (CTAP).