In this paper, the authors implement the real time scheduling algorithms and discuss the advantages and disadvantages of the same. They compare the scheduling algorithm in which tasks execute. In this no efficient scheduling algorithms exit for optimal solution. They are trying to solve this problem by taking new algorithm i.e. with shortest (arrival time + completion time) is considered and implemented on single processor they are using assumptions and some terminology, this algorithm is based on preemption.