in a multi-processor system only one process can run at a time. Other processes must wait until the
CPU is free and can be rescheduled

selects from among the processes in ready queue, and allocates the CPU to one of them

When a process switches from running to waiting state – This scheduling is

When a process switches from running to ready state – This scheduling is

When a process switches from waiting to ready state – This scheduling is

When a process terminates – This scheduling is

time it takes for the dispatcher to stop one process and start another running

time required for a particular process to complete, from submission time to completion

Exit time - Arrival time

Turnaround time - Burst time

start time - arrival time

every process in a computer system requires some amount of time for its execution. This time is
both the CPU time and the I/O time

FCFS is optimal average waiting time

FCFS scheduling is a nonpreemptive algorithm

Convoy effect leads to

Associate with each process the length of its next CPU burst