hello :)

i'm looking for an algo to find out all possible combinations of a 2d array entries, wich are (Tasks x Processors).

i.e, i have to find out all possible schedules to schedule tasks against processors. numbers of tasks and processors are variable.

Suppose :

............P1.......P2.......P3

....................................

T1........3 ........6..........4

T2........5.........1..........7

T3........6.........5..........4

T4........2.........4..........5

(where T=Task and P=Processor)

in above example, obviously, the optimum schedule will be:

T1 -> p1

T2 -> p2

T3 -> p3

T4 -> p1

(where " -> " means, 'should be assigned to')

but i need to find all the possibilities of scheduling. (all possible combinations).

out of all possible combinations, then i'll find the minimum one.

plz guide me :)

Thanks :)

*Edited 4 Years Ago by Z33shan*