First-Come, First-Served (FCFS) is a scheduling algorithm that processes requests in the order they arrive, without prioritization, making it simple but potentially inefficient for systems with varying task lengths. It is commonly used in queue management and can lead to the 'convoy effect,' where short processes are delayed by longer ones, impacting overall system performance.