13. [Individual Problem] Group 6 grades this problem
Give any solution to the 'incredible task scheduler" problem.
Prove the correctness of your algorithm. Give an analysis of
its worst case run time as a function of D, the number of developers,
A, the number of tasks, and B, the sum of the effort values of the
tasks.
There is no requirement that your algorithm be particularly efficient.
Strive mainly for clarity of presentation and ease of proof.
Remark: Use the arithmetic complexity model. In this model,
the basic arithmetic operations cost O(1) regardless of the size of the
numbers. In particular, for many of the more easily developed algorithms
to solve the problem, it may not be necessary to involve B in the
run time analysis.
14. [Group Problem] Laskov grades this problem
Give a dynamic programming solution to the "incredible task scheduler"
problem, for the case D = 2. Argue the correctness of your algorithm.
Show the arithmetic complexity of your algorithm is polynomial in A and B.