Scheduling means a set of policies and mechanisms to control the order of work to be performed by a computer system. The basic idea behind scheduling is to keep the CPU busy as much as possible by executing a process until it must wait for an event and then switch to anther process. In this paper, we discuss & analyze various types of Scheduling & try to obtain a better solution to get more throughputs with less CPU utilization. First Come First Served (FCFS) is a non-preemptive, simplest scheduling. FCFS performs better for long job. Shortest Job First (SJF) scheduling selects that job first which has shortest processing time. Round Robin (RR) scheduling removes the drawbacks of FCFS by preempting running jobs periodically. But if the length of quantum is too short then more time will waste in context switching. In Priority Based scheduling each process is assigned a priority.

1. MohammadReza EffatParvar, Karim Faez, Mehdi EffatParvar, Mehdi Zarei, Saeed Safari. An Intelligent MLFQ Scheduling Algorithm (IMLFQ) with Fault Tolerant Mechanism
2. Shiann-Tsong Sheu, Yue-Ru Chuang and Hsuen- Wen Tseng. A Pipelined Scheduling Strategy for Supporting Variable-Length Packets in WDM Networks.
3. J. M. Arco D. Meziat B. Alarcos. Deficit Round Robin Alternated: A New Scheduling Algorithm
4. . Roberto Riggio, Daniele Miorandi, and Imrich Chlamtac. Airtime Deficit Round Robin (ADRR) Packet Scheduling Algorithm_
5. T. Funkhouser and P. Shilane. Partial Matching of 3D Shapes with Priority-Driven Search

Scheduling FCFS Scheduling Shortest Job First Scheduling Round Robin Scheduling Priority Based Scheduling