Loading...
Please wait, while we are loading the content...
Similar Documents
Computing the envelope for stepwise-constant resource allocations
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Muscettola, Nicola |
| Copyright Year | 2002 |
| Description | Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edges equal to the necessary predecessor links between events. A staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. Each stage has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible and promising for use in the inner loop of flexible-time scheduling algorithms. |
| File Size | 793426 |
| Page Count | 14 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_20020079823 |
| Archival Resource Key | ark:/13960/t0ns5q50f |
| Language | English |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Computer Programming And Software Scheduling Constraints Algorithms Events Logistics Resource Allocation Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Article |
