“…These problems may be categorized as static [1,2,3,4,5,6,7,8,9] and dynamic [10,11,12,13,14] types of task allocation. Some of the other related methods have been reported in the literature, such as, Integer Programming [15], Load Balancing [16,17,18,19,20,21,22,23], Divide and Conquer [24], Grid Computing [25] and Branch and Bound [26,27]. Tasks are allocated to various processors of the distributed environment in such a way that overall processing cost of the network should be minimized.…”