In the realm of computer systems, efficient utilisation of the CPU (Central
Processing Unit) has always been a paramount concern. Researchers and engineers
have long sought ways to optimise process execution on the CPU, leading to the
emergence of CPU scheduling as a field of study. This research proposes a novel
algorithm for batch processing that operates on a preemptive model, dynamically
assigning priorities based on a robust ratio, employing a dynamic time slice,
and utilising periodic sorting technique to achieve fairness. By engineering
this responsive and fair model, the proposed algorithm strikes a delicate
balance between efficiency and fairness, providing an optimised solution for
batch scheduling while ensuring system responsiveness