Hello Mudassar, the solution to your problem formulation leads to a CPU load z = 76. The minimum load possible (zmin) is 52.
Your problem could be solved much faster, if you separated it into two. First calculate the minimum possible load in a problem formulation which does not care about the communication cost. Second calculate the minimum possible communication cost for the maximum CPU load (zmax) that you allow. Solving the complete problem (with the two symmetry breaking constraints which I proposed yesterday, and option --cuts) takes my computer 310 seconds. Determining the minimum possible load takes 27 seconds. Determining the minimum communication cost for zmax = 76 takes 81 seconds. If you put a tighter constraint on the load, the solution is calculated faster, e.g for zmax = zmin = 52: 5 seconds. Did you think about replacing communication cost by communication time? TotalTime >= CPU time TotalTime >= Communication / Bandwidth Minimize TotalTime. In this case, you might first calculate the minimum CPU time for unlimited bandwidth. Minimize communication for minimum CPU time, and check if bandwidth is a problem. If yes, minizme processing time for minimum bandwidth and check if CPU time is limiting. If yes, minimize total time. Best regards Xypron -- Follow me at http://twitter.com/#!/xypron Empfehlen Sie GMX DSL Ihren Freunden und Bekannten und wir belohnen Sie mit bis zu 50,- Euro! https://freundschaftswerbung.gmx.de _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
