FCFS Scheduling:

First-come, first-served algorithm is just performing I/O request in the order of request arrival. This often does not provide fastest service.
SSTF Scheduling:

Shortest-seek-time-first algorithm chooses the pending request closest to the current head postion. This algorithm gives a substantial improvement in performance, but it is possible to cause starvation in some situation.