Abstract: Dynamic schedules are created by using a budgeting process for allocating time. Time available is first allocated to the system. Once time resources are allocated, fixed tasks are subtracted out of the time resources, leaving only flexible time which the user will use for all other tasks. Variable tasks may be added by entering due date, task description, task dependencies, and priority. An algorithm is used to maximize the user's schedule. The algorithm schedules rapidly, prevents late tasks, and readjusts to accommodate for unplanned events or new tasks.