One of the fundamental function of an operating system is scheduling. There are 2 types of uni-processor operating system in general. Those are uni-programming and multi-programming. Uni-programming operating system execute only single job at a time while multiprogramming operating system is capable of executing multiple jobs concurrently. Resource utilization is the basic aim of multi-programming operating system. There are many scheduling algorithms available for multi-programming operating system. But our work focuses on design and development aspect of new and novel scheduling algorithm for multi-programming operating system in the view of optimization. We developed a tool which gives output in the form of experimental results with respect to some standard and new scheduling algorithms e. g. First come first serve, shortest job first, round robin, optimal and a novel cpu scheduling algorithm etc.

1. Hybrid Scheduling and Dual Queue Scheduling Syed Nasir Shah,Ahmad Mahmood,Alan Oxley 2009-IEEE 978-1-4244-4520-2/09 Conference
2. Operating System concepts 7th Edition,By Galvin,Silberschatz,Gange John Wiley & Sons, 2005
3. http://www1bpt. bridgeport. edu/sed/projects/cs503/Spring_2001/kode/os/scheduling. htm
4. Milan Milenkovic, "Operting System Concepts and Design", Second Edition McGraw Hill International, 1992
5. Leland L. Beck, "System Software", 3rd Ed. , Addison Wesley, 1997
6. A Novel CPU Scheduling Algorithm – Preemptive & Non Preemptive, International Journal of Modern Engineering Research, Volume2 Issue 6 Nov – Dec 2012.
7. Efficient Round Robin CPU Scheduling Algorithm, International Journal of Engineering Research and Development, Volume 4, Issue 9 (November 2012).

Operating System Uni-processor Uni Programming Multi-programming Resource Utilization Scheduling Fcfs Sjf Priority Round Robin A Novel Cpu Scheduling Algorithm