hi! i have to solve a problem using search techniques in java ...the problem is like that we have 14 machines and three servicemen..and the distance b/w all the machines in time are given..each service men receive every morning message that which machines require service..so they all have to start from 0 start position and after servicing the machines have to come back at that start position to go back home..Now we have to search all this in minimum time..means performance is measured in time...in how much time they all finish thier work..plz give me some hint about the searching algorithm which does this searching very efficiently..
Previous Topic
