Scheduling a sequence of jobs released over time when the processing time of a job is only known
at its completion is a classical problem in CPU scheduling in time sharing and real time operating
systems. Previous approaches to scheduling computer systems have focused primarily on systemlevel
abstractions for the scheduling decision functions or for the mechanisms that are used to
implement them. This paper introduces a new scheduling concept New Multi Level Feedback
Queue (NMLFQ) algorithm. It’s important to get a good response time with interactive tasks
while keeping other tasks from starvation. In this research paper, we prove that a New version of
the Multilevel Feedback queue algorithm is competitive for single machine system, in our opinion
providing theoretical validation of the goodness of the idea that has proven effective in practice.
New Optimal Solutions for Real-Time Scheduling of Operating System Tasks Based on Neural Networks
