The document proposes a Medium Job High Priority (MJHP) scheduling algorithm for job scheduling in cloud computing. It classifies jobs as high, medium, or low priority based on their computational complexity and level of parallelism. The MJHP algorithm prioritizes jobs with medium computational complexity and high parallelism. It assigns these medium priority jobs to the fastest available resources to optimize computational speed and reduce resource usage. Performance studies show that MJHP outperforms existing algorithms like First Come First Serve, Shortest Job Fastest Resource, and Priority Based Scheduling by achieving the highest throughput in the shortest time.