IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v16y2019i3p1-28.html
   My bibliography  Save this article

Business Process Driven Trust-Based Task Scheduling

Author

Listed:
  • Jian Shu

    (Anhui Science and Technology University, College of Management, Bengbu, China)

  • Hemant Jain

    (The University of Tennessee at Chattanooga, Gary W. Rollins College of Business, USA)

  • Changyong Liang

    (Hefei University of Technology, Management School, Hefei, China)

Abstract

The demand for agile and flexible business application systems has sparked interest in using cloud computing technology to respond quickly and effectively to a dynamic business environment. The authors classify the appropriate cloud services as a multi-objectives task scheduling problem in a hybrid cloud service system. In this article, the authors propose a business process (BP) driven task scheduling system that supports multiple clouds, including private ones. A trust-based non-dominated sorting genetic algorithm (NSGA2) is developed to solve the multi-objective task scheduling problem. By sorting populations into different hierarchies based on the ordering of Pareto dominance, they identify a Pareto-optimal multi-dimensional frontier that permits managers to reconcile conflicting objectives when scheduling tasks on cloud resources. The authors illustrate the usability and effectiveness of their approach by applying it to a case study conducting simulated experiments.

Suggested Citation

  • Jian Shu & Hemant Jain & Changyong Liang, 2019. "Business Process Driven Trust-Based Task Scheduling," International Journal of Web Services Research (IJWSR), IGI Global, vol. 16(3), pages 1-28, July.
    • Handle: RePEc:igg:jwsr00:v:16:y:2019:i:3:p:1-28
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWSR.2019070101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwsr00:v:16:y:2019:i:3:p:1-28. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.