First-Come, First-Served Scheduling is a simple and straightforward scheduling algorithm where the process that arrives first is executed first, making it non-preemptive. It can lead to the 'convoy effect' where shorter processes wait for longer ones, potentially causing inefficiencies in process handling.