An Optimized Solution to Harmonized First-Come-First-Serve Based Multiple Queues Using Sets of Predefined Burst Time

There are many scheduling algorithms in existence today, each with key features, advantages, and drawbacks. Scheduling algorithms are the solutions to queuing problems in computing environment which also has real life application; each scheduling algorithm comes with its unique set of advantages, drawbacks, situations, and environments where they perform at optimal levels. This paper aims to propose an optimized scheduling algorithm which will eliminate possible drawbacks. This is achieved by implementing the solutions which have shown positive results in computing environment and in the business environment.