Computing the Envelope for Stepwise-Constant Resource Allocations
Nicola Muscettola
- 09 Sep 2002
- pp 139-154
TL;DR: An efficient algorithm that builds a resource envelope, the tightest possible such bound, based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edgesequal to the necessary predecessor links between events is described.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Activity planning for the Mars Exploration Rovers
John L. Bresina,Ari K. Jonsson,Paul Morris,Kanna Rajan +3 more
- 05 Jun 2005
TL;DR: The adaptation of constraint-based planning and temporal reasoning to a mixed-initiative setting and the key technical solutions developed for the mission deployment of MAPGEN are described.
A theoretic and practical framework for scheduling in a stochastic environment
TL;DR: A typology is proposed that distinguishes between proactive, progressive, and revision approaches, and a theoretic model integrating those three approaches is defined, focusing on scheduling and schedule execution.
•Journal Article
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
TL;DR: This paper introduces the concept of a Partial Order Schedule (POS), a type of temporally flexible schedule in which each embedded temporal solution is also guaranteed to be resource feasible, as a target class of solutions that exploit flexibility in a robust way.
Robust Scheduling of Task Graphs under Execution Time Uncertainty
TL;DR: This work tackles predictable and efficient nonpreemptive scheduling of multitask applications in the presence of duration uncertainty by exploiting a hybrid offline/online technique known as Precedence Constraint Posting (PCP), and the results are very promising, as the PCP schedules exhibit good stability and improved average execution time.
53
•Journal Article
Scheduling with uncertainty: A proactive approach using Partial Order Schedules: Thesis
TL;DR: The broad question of how to build schedules that are robust in the face of dynamicexecution environments is addressed, and the thesis defended is that to safeguard against unforeseen events.
52
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•Book
Introduction to sequencing and scheduling
A. J. Clewett
- 01 Jan 1974
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
2.8K
Temporal constraint networks
TL;DR: It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.
2.1K
A new approach to the maximum-flow problem
TL;DR: An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.