In scenario 1, jobs are allotted to three fog nodes with a time-shared scheduling approach. FOG1 will get fewer reward points than other fog nodes. More tasks are allocated to FOG2 and FOG3 than FOG1 due to the proposed EACQL algorithm. FOG2 and FOG3 got more reward points whenever they were selected after satisfying the energy constraints and had the least expected completion time. This ensures faster responses and the completion of jobs at the earliest finish time.
