Cloud computing is a new resource provisioning mechanism, which represents a convenient way for users to access different computing resources. Periodical workflow applications commonly exist in scientific and business analysis, among many other fields. One of the most challenging problems is to determine the right amount of resources for multiple periodical workflow applications. In this paper, the periodical workflow applications scheduling problem with total renting cost minimization is considered. The novelty of this work relies precisely on this objective function, which is more realistic in practice than the more commonly considered makespan minimization. An integer programming model is constructed for the problem under study. A Precedence Tree based Heuristic (PTH) is developed which considers three types of initial schedule construction methods. Based on the initial schedule, two improvement procedures are presented. The proposed methods are compared with existing algorithms for the related makespan based multiple workflow scheduling problem. Experimental and statistical results demonstrate the effectiveness and efficiency of the proposed algorithm.

中文翻译：

---

期刊云工作流应用资源租用

云计算是一种新的资源供应机制，它代表了用户访问不同计算资源的便捷方式。定期工作流应用程序通常存在于科学和商业分析以及许多其他领域。最具挑战性的问题之一是为多个定期工作流应用程序确定合适的资源量。本文研究了具有总租用成本最小化的期刊工作流应用调度问题。这项工作的新颖性正是依赖于这个目标函数，它在实践中比更普遍认为的完工时间最小化更现实。针对所研究的问题构建整数规划模型。开发了一种基于优先树的启发式 (PTH)，它考虑了三种类型的初始进度表构建方法。根据最初的计划，提出了两个改进程序。将所提出的方法与针对相关的基于制造跨度的多工作流调度问题的现有算法进行比较。实验和统计结果证明了所提出算法的有效性和效率。