So, a good scheduling algorithm should possess
the following characteristics:
• Context switches should be minimum. CPU
utilization should be maximum.
• Throughput should be maximum. Turnaround
time should be minimum.
• Waiting time should be minimum. Response
time should be minimum
• Fairness in resource allocation is retained.