Formula to solve any (Non-Preemptive) Gantt Chart

Each scheduling algorithm favors particular criteria:
(http://academic.udayton.edu/SaverioPerugini/courses/cps346/lecture_notes/scheduling.html)

• CPU utilization (maximize)
• throughput: number of processes which complete execution per time unit (maximize)
• turnaround time (TA): total amount of time to execute a particular process (minimize)
• waiting time: amount of time a process has been waiting in the ready queue (minimize)
• response time: amount of time it takes from when a request is submitted to when the response is produced (minimize); does not include the time for a response to be output

Formula to solve any (Non-Preemptive) Gantt Chart:
Waiting Time = Service Time - Arrival Time
Turnaround Time = Finish Time - Arrival Time
Finish Time = Service time + Burst Time
Service Time = Service Time of previous process + Burst Time of previous process