Optimum algorithm

Two workers has several tasks.Assume the tasks has duration of 14, 7, 2, 4. The next task goes to first worker that is free. The two workers have to finish several tasks in one day. The same开发者_如何学JAVA task takes the same time on the two workers. Our goal is to finish the tasks as soon as possible.

Two questions: 1.show that the algorithm always completes the task prior to time 2*T,T is the optimum completion time. 2.express the optimum scheduling with a resursion(multi-dimentonal)

Not HW PRoblem

Please give me some suggestions

What is a multi-dimentional recursion?

Since you ask for suggestions...

Try drawing the problem out. Have a timeline for worker #1 and worker #2 and specify what tasks they are working on for what stretches of time. Once you understand why this algorithm completes in less than 2*T time, you then can start figuring out how to formally prove it.