Observations on Using Genetic Algorithms for Dynamic Load-Balancing
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Time Constraints in Workflow Systems
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Policies in a Resource Manager of Work ow Systems: Modeling, Enforcement and Management
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
An architecture for workflow scheduling under resource allocation constraints
Information Systems
Scheduling of scientific workflows in the ASKALON grid environment
ACM SIGMOD Record
Cost-Based Scheduling of Scientific Workflow Application on Utility Grids
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Work Distribution and Resource Management in BPEL4People: Capabilities and Opportunities
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
Adaptive workflow scheduling under resource allocation constraints and network dynamics
Proceedings of the VLDB Endowment
Resource Allocation vs. Business Process Improvement: How They Impact on Each Other
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Workflow resource patterns: identification, representation and tool support
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Business process scheduling with resource availability constraints
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Hi-index | 0.00 |
Resource allocation has been recognised as an important topic for business process execution. In this paper, we focus on planning resources for a massive number of process instances to meet the process requirements and cater for rational utilisation of resources before execution. After a motivating example, we present a model for planning resources for process instances. Then we design a set of heuristic rules that take both optimised planning at build time and instance dependencies at run time into account. Based on these rules we propose two strategies, one is called holistic and the other is called batched, for resource planning. Both strategies target a lower cost, however, the holistic strategy can achieve an earlier deadline while the batched strategy aims at rational use of resources. We discuss how to find balance between them in the paper with a comprehensive experimental study on these two approaches.