Comparison between Scheduling Algorithms of Independed Processing with a proposed algorithm

This paper investigates the analysis of scheduling algorithm of independed processing like the Longest Processing Time Scheduling algorithm(LPT) and Shortest Processing Time Scheduling algorithm(SPT) and walking a comparison between them with a proposed algorithm depending on the measuring length scheduling of each of algorithms to get the ideal solution through applying some examples.