Quick and efficient: SJF always picks the shortest job first!
The Dining Philosophers Problem: a table for five, but not enough forks to go around!
Look/C-Look: The disk scheduling algorithm that knows where to look!
Get in line with FIFO: where the first process to arrive is the first to be served!