Algorith development

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 represent a processor and 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 which 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 which 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 provided a zip file of the product we have which we have to further develop.