IMPLEMENTING A SHORTEST REMAINING TIME NEXT PROCESSOR SCHEDULING ALGORITHM IN A FLUTTER APPLICATION TO HELP WITH INDIVIDUAL TIME MANAGEMENT

Abstract

Most work in the world is accompanied by a deadline, a set time in the future where the work is expected to be completed. Many individuals often see deadlines not for when the deadline should be finished, but rather for when the deadline should be started. This leads to the problem where deadlines are put off, or set aside for easier and more comfortable activities; distractions. The advances in technology are not helping as more of these easier activities become readily available. If individuals frequently use their mobile devices in their daily lives, perhaps an application could help organise when the individual should be working on deadlines, providing a representation of time they should spend in the future focusing on their deadlines. The individual should not need to spend the effort in inputting the times they wish to work. They should simply input the time when their deadline is due and an estimation for how long they need to complete it. This would create a schedule of times the individual may follow to complete all their deadlines. A scheduling algorithm from computer science, such as Shortest Remaining Time Next, could be used to generate this schedule. With a visual representation of the generated schedule, the individual may be more inclined to follow it. Thus, deadlines that were once set aside, might actually be worked upon.