Description: best height of the problem. Problem description : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the time t (i). Try to find an algorithm designed to complete tasks n the best scheduling, made to complete all tasks in the first.
- [lqx10002] - best height of the problem. Problem desc
- [Desktop] - Scheduling problem backtracking algorith
File list (Check if you may need any files):
shizi.txt
Download