Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A novel hybrid meta heuristic approach for optimization of makespan and handling imbalance in task scheduling in cloud environments
by
Nayyar, Anand
, Patel, Sanjeev
, Tandon, Akanksha
in
Artificial Intelligence
/ Computer Appl. in Administrative Data Processing
/ Computer Communication Networks
/ Computer Science
/ Information Systems Applications (incl.Internet)
/ Regular Paper
/ Software Engineering
2025
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A novel hybrid meta heuristic approach for optimization of makespan and handling imbalance in task scheduling in cloud environments
by
Nayyar, Anand
, Patel, Sanjeev
, Tandon, Akanksha
in
Artificial Intelligence
/ Computer Appl. in Administrative Data Processing
/ Computer Communication Networks
/ Computer Science
/ Information Systems Applications (incl.Internet)
/ Regular Paper
/ Software Engineering
2025
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A novel hybrid meta heuristic approach for optimization of makespan and handling imbalance in task scheduling in cloud environments
by
Nayyar, Anand
, Patel, Sanjeev
, Tandon, Akanksha
in
Artificial Intelligence
/ Computer Appl. in Administrative Data Processing
/ Computer Communication Networks
/ Computer Science
/ Information Systems Applications (incl.Internet)
/ Regular Paper
/ Software Engineering
2025
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A novel hybrid meta heuristic approach for optimization of makespan and handling imbalance in task scheduling in cloud environments
Journal Article
A novel hybrid meta heuristic approach for optimization of makespan and handling imbalance in task scheduling in cloud environments
2025
Request Book From Autostore
and Choose the Collection Method
Overview
The growing demand for efficient cloud computing solutions has highlighted the need for advanced task-scheduling techniques that minimize execution time and energy consumption. An appropriate fitness function for nature-inspired optimization may lead to improvement in performance. Our research aims to bridge this gap by proposing novel optimization-based task-scheduling techniques using nature-inspired meta-heuristic algorithms. An enhanced initialization approach for particle swarm optimization (PSO) is introduced, and an ellipsoid function as the fitness function to optimize key performance metrics, including makespan, execution time, energy consumption, and degree of imbalance, is applied. Additionally, we explore a genetic approach for further optimization. The proposed algorithms, longest job-based optimization (LJPBO), efficient task scheduling-based optimization (ETSBO), dynamic completion time-based optimization (DCTBO), and dynamic completion time-based genetic algorithm (DCTBGA), are evaluated against existing algorithms using performance measures. The results demonstrate substantial improvements of proposed algorithms LJPBO, ETSBO, DCTBO, and DCTBGA, with respect to MCTPSO with reductions in energy consumption of 50.6901%, 8.9008%, 20.2066%, and 78.0909%, respectively, for 100 VMs and 400 tasks. The experiments were conducted on a Windows machine with an Intel i7-6700 processor running at 3.4 GHz and 8 GB of memory. Further, MinMin PSO task scheduling algorithm is proposed, which achieved the lowest makespan.
Publisher
Springer Vienna
This website uses cookies to ensure you get the best experience on our website.