Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
A branch and bound method for stochastic global optimization
Mathematical Programming: Series A and B
Bus access optimization for distributed embedded systems based on schedulability analysis
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Constraint-directed techniques for scheduling alternative activities
Artificial Intelligence
Allocation and scheduling of conditional task graph in hardware/software co-synthesis
Proceedings of the conference on Design, automation and test in Europe
Optimizing compilers for modern architectures: a dependence-based approach
Optimizing compilers for modern architectures: a dependence-based approach
Constraint-Based Scheduling
Constraints-driven scheduling and resource assignment
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Constraint Processing
Power-aware scheduling of conditional task graphs in real-time multiprocessor systems
Proceedings of the 2003 international symposium on Low power electronics and design
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
Business Process Management: Concepts, Languages, Architectures
Business Process Management: Concepts, Languages, Architectures
A general framework for scheduling in a stochastic environment
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Handling alternative activities in resource-constrained project scheduling problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Business process management: a survey
BPM'03 Proceedings of the 2003 international conference on Business process management
Scheduling conditional task graphs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Stochastic allocation and scheduling for conditional task graphs in MPSoCs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Workflow resource patterns: identification, representation and tool support
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
The integer L-shaped method for stochastic integer programs with complete recourse
Operations Research Letters
Hi-index | 0.00 |
We propose an original, complete and efficient approach to the allocation and scheduling of Conditional Task Graphs (CTGs). In CTGs, nodes represent activities, some of them are branches and are labeled with a condition, arcs rooted in branch nodes are labeled with condition outcomes and a corresponding probability. A task is executed at run time if the condition outcomes that label the arcs in the path to the task hold at schedule execution time; this can be captured off-line by adopting a stochastic model. Tasks need for their execution either unary or cumulative resources and some tasks can be executed on alternative resources. The solution to the problem is a single assignment of a resource and of a start time to each task so that the allocation and schedule is feasible in each scenario and the expected value of a given objective function is optimized. For this problem we need to extend traditional constraint-based scheduling techniques in two directions: (i) compute the probability of sets of scenarios in polynomial time, in order to get the expected value of the objective function; (ii) define conditional constraints that ensure feasibility in all scenarios. We show the application of this framework on problems with objective functions depending either on the allocation of resources to tasks or on the scheduling part. Also, we present the conditional extension to the timetable global constraint. Experimental results show the effectiveness of the approach on a set of benchmarks taken from the field of embedded system design. Comparing our solver with a scenario based solver proposed in the literature, we show the advantages of our approach both in terms of execution time and solution quality.