Billing Queue Scheduling using Priority Scheduling and Shortest Job First Scheduling Algorithm
The main task of a Central Processing Unit (CPU) scheduler is to allocate resources of various tasks to the CPU for processing. Various standard algorithms used to perform scheduling are First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling and Round Robin (RR) Scheduling algorithm. This paper proposes a new scheduling algorithm which is a combination of standard CPU scheduling algorithms like Priority scheduling and Shortest Job first algorithm. This algorithm can be used in real-world scenarios like grocery store where customers in a queue are to be scheduled for billing. The approach is to maximize the profits by avoiding the loss of higher profit yielding customers. Also, an effort is made to reduce the starvation of lower profit yielding customers. A comparative analysis of our proposed algorithm with standard scheduling algorithms like First Come First Serve (FCFS) and Priority Scheduling has shown promising results with respect to waiting time and profit gained by the grocery shop.
Keywords - First Come First Serve, Shortest Job First (SJF), Priority scheduling, waiting time.