Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in OS and Networks
Dynamic Task Scheduling Problem: Greedy Knapsack Solution, Christian Sandtveit, Darrin Winger, Jeremy Straub, Eunjin Kim
Dynamic Task Scheduling Problem: Greedy Knapsack Solution, Christian Sandtveit, Darrin Winger, Jeremy Straub, Eunjin Kim
Jeremy Straub
The problem that we worked with was a dynamic scheduling problem. For this problem, we are given a set of tasks to be scheduled in an allotted time slot, so that the total value of the tasks done is maximized. Each task has a duration, value. Each task also has one or more periods in which they can be scheduled. Some tasks can have conflicting time slots that can prevent other tasks from being scheduled. As tasks are assigned time slots it is possible to prevent other tasks from being as-signed a time slot. Looking for ways to minimize the …