List-based scheduling is generally accepted as an attractive approach to static task scheduling since it combines low complexity with good results. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous computing systems and almost none of them target heterogeneous communication systems. In this paper we present a simple scheduling algorithm based on list-scheduling and task-duplication on a bounded number of heterogeneous machines called Heterogenous Critical Nodes with Fast Duplicator (HCNFD). The suggested algorithm supports both heterogeneous computation and communication environments. The analysis and experiments have shown that HCNFD outperforms on average all other higher complexity algorithms.