nPossibility of starvation for longer processes as long as there is a steady supply of shorter processes
nLack of preemption is not suited in a time sharing environment
uCPU bound process gets lower priority (as it should) but a process doing no I/O could still monopolize the CPU if he is the first one to enter the system
nSPN implicitly incorporates priorities: shortest jobs are given preferences
nThe next (preemptive) algorithm penalizes directly
longer jobs
n
n