This is a project that implements the 'scheduling policy' of the Operating System.
Implementation target: FCFS, SJF, RR, MLFQ, lottery scheduling

• Schedule the process that arrives first
• Advantage: Simple and easy to implement
• Disadvantage: Convoy effect occurs

• Schedule the process with the shortest execution time first
• Advantage: If all tasks arrive at the same time, turnaround time can be minimized
• Disadvantage: Convoy effect occurs

• Schedule the process only for a time slice and switch to the next process.
• The shorter the time slice, the better the response time.
• However, the shorter the time slice, the higher the context exchange cost.
• Advantage: The response time is fast.
• Disadvantage: The turnaround time is slow.