C sharp programming, Web communication form(WCF), Algorithm

The ideal goal is to find one or more allocation where the runtime of tasks in a processor is less than the program duration and satisfies the ram of the processor. A row represents a processor and a column represents a task. Value one means a task is allocated. we have an array of runtimes and ram along with the number of tasks and processor ​what you need to do is to create an algorithm that can find all the possible allocation and check with the constrains to see if it is valid. Constrains are All the tasks allocated in a processor must have runtimes less than the program duration which is given Must satisfy the ram of the processor. no tasks must be allocated in a processor that exceeds the ram of the processor. No task should be allocated more than once. Each processor must have at least one task allocated. I have attached a zip file that contains all the calculations for energy and all. You can't see the code, but you can use main methods from it. I have also attached a rubric, that can let you know what are the constrains for the assessment, like the whole program should give output in less that 5 minutes and many more. Hope this clears up, let me know if you can do it. I have screenshots of a similar program output and i require the same output