Abstract
The task scheduling problem in a heterogeneous system (TSPHS) is a NP-complete problem. It is a multiobjective optimization problem (MOP).The objectives such as makespan, average flow time, robustness and reliability of the schedule are considered for solving task scheduling problem. This paper considers three objectives of minimizing the makespan (schedule length), minimizing the average flow-time and maximizing the reliability in the multiobjective task scheduling problem. Multiobjective Evolutionary Computation algorithms (MOEAs) are well suited for Multiobjective task scheduling for heterogeneous environment. The two Multi-Objective Evolutionary Algorithms such as Multiobjective Genetic Algorithm (MOGA) and Multiobjective Evolutionary Programming (MOEP) with non-dominated sorting are developed and compared for the various random task graphs and also for a real-time numerical application graph. This paper also demonstrates the capabilities of MOEAs to generate well-distributed pareto optimal fronts in a single run.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
