Cloud computing platform offers numerous applications and resources such as data storage, databases, and network building. However, efficient task scheduling is crucial for maximizing the overall execution time. In this study, workflows are used as datasets to compare scheduling algorithms, including Shortest Job First, First Come, First Served, (DVFS) and Energy Management Algorithms (EMA). To facilitate comparison, the number of virtual machines in the Visual Studio Net framework environment is increased. The experimental findings indicate that increasing the number of virtual machines reduces Makespan. Moreover, the Energy Management Algorithm (EMA) outperforms Shortest Job First by 2.79% for the CyberShake process and surpasses the First Come, First Serve algorithm by 12.28%. Additionally, EMA produces 21.88% better results than both algorithms combined. For the Montage process, EMA performs 4.50% better than Shortest Job First and 25.75% superior to the First Come, First Serve policy. Finally, we ran simulations to determine the performance of the suggested mechanism and contrasted it with the widely used energy-efficient techniques. The simulation results demonstrate that the suggested structural design may successfully reduce the amount of data and give suitable scheduling to the cloud. INDEX TERMS Energy Management Algorithm (EMA); First come First Serve (DVFS); Shortest Job First (RR); Makespan; VMs I. INTRODUCTION