A graph partitioning-based heuristic load-balancing algorithm known as the Largest-task-first-with-minimum-finish-time-and-available-communication-costs from EVAH package [3] is modified in order to be dynamically adapted to heterogeneous computing environments like a grid. An example is given to show the improvement.