Sciweavers

IAT
2005
IEEE

Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem

13 years 9 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which represent the problem by an acyclic graph, and solves each node in a certain order so as to produce an optimal solution. Then, we detail a second algorithm, which solves each task separately, using the first approach, and where an on-line heuristic computes the global actions to execute when the state of a task changes.
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where IAT
Authors Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak Benaskeur
Comments (0)