IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v35y2025i1ne2318.html
   My bibliography  Save this article

An Efficient Workflow Scheduling Using Genetically Modified Golden Jackal Optimization With Recurrent Autoencoder in Cloud Computing

Author

Listed:
  • Saurav Tripathi
  • Sarsij Tripathi

Abstract

In this paper, a novel workflow scheduling framework is proposed using genetically modified golden jackal optimization (GM‐GJO) with recurrent autoencoder. An integrated autoencoder and bidirectional gated recurrent unit (iAE‐BiGRU) are used to forecast the number of virtual machines (VMs) needed to manage the system's present workload. The following step involves assigning the tasks of several workflows to cloud VMs through the use of the GM‐GJO method for multiworkflow scheduling. GM‐GJO provides optimal workflow scheduling by considering minimal maximizing utilization rate, minimizing makespan, and minimizing the number of deadline missed workflows. The proposed approach attempts to allocate the best possible set of resources for the workflows based on objectives such as deadline, cost, and quality of service (QoS). Extensive experiments were conducted with the CloudSIM tool, and the performance is evaluated in terms of scheduling length ratio, cost, QoS, etc. The execution time of 513.45 ms is achieved with a Sipht workflow of 30 tasks. When comparing the suggested strategy to the current methodologies, the suggested approach performs better.

Suggested Citation

  • Saurav Tripathi & Sarsij Tripathi, 2025. "An Efficient Workflow Scheduling Using Genetically Modified Golden Jackal Optimization With Recurrent Autoencoder in Cloud Computing," International Journal of Network Management, John Wiley & Sons, vol. 35(1), January.
  • Handle: RePEc:wly:intnem:v:35:y:2025:i:1:n:e2318
    DOI: 10.1002/nem.2318
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2318
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2318?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:wly:intnem:v:35:y:2025:i:1:n:e2318. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.