Our rebuttal statement is in two parts. A. Generic rebuttal: the area of scheduling is very active with more than 3,000 papers published over this decade alone in good journals. In addition, Krishna and Shin note, in 1997 itself, that the number of papers in the area seems to have increased exponentially since 1970. As a consequence, it is rather difficult to get a handle on all of them.. The records indicate that several aspects of our work appear to be very contemporary to the works of some of the other's work cited by the author. This goes to show that more than one person can have the similar approach to solving similar problems. B. Technical rebuttal: the work quoted by Sohn et al. (1998) deals with the analysis of heterogeneous CPUs. In particular, with the analysis of minimizing the cost (as in $) by selecting the lowest selection of CPUs available that will finish a job in a given time frame. They also analyze the minimum time as well for a given selection of CPUs. Their timeline shows all processes finishing at the same time and does not take into account applications that transfer result data, which our paper does.