ABA: an assignment based algorithm for resource allocation

Authors:
Carla Pedro Gomes;Julie Hsu
Affiliations:
-;-
Venue:
ACM SIGART Bulletin
Year:
1996

Citing 5
Cited 1

Graphs and algorithms

Graphs and algorithms
Construction and maintaining detailed production plans: Investigations into the development of knowledge-based factory scheduling systems

AI Magazine
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Look-ahead techniques for micro-opportunistic job shop scheduling

Look-ahead techniques for micro-opportunistic job shop scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Resource Allocation Optimization for GSD Projects

ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe an approach to allocating a set of tasks to a set of resources or processors. The novelty of the approach has to do with the way decisions are performed. Rather than making one decision about one resource (or one task) at a time, several decisions concerning multiple resources and multiple tasks are made at a time. The algorithm incorporates the formulation of the assignment problem. Furthermore, knowledge about temporal constraints between activities is exploited to improve the computational efficiency of the algorithm. The algorithm is very flexible, allowing for the incorporation of different types of constraints as well as the consideration of non-equivalent resources.