Multi objective scheduling problems are considered NP-complete. Hence, calls for a most appropriate heuristic scheduling algorithm to address the issue. Numerous heuristic algorithms have been proposed by researchers in the past, however choosing a most appropriate algorithm for the problem under a particular nature is a difficult task because the algorithms are advanced under numerous assumptions. Therefore, on this observation in this article we discussed four metaheuristic algorithms to solve multi-objective subtask scheduling problems and provided a detailed working mechanism to select the suitable algorithm for the kind of applications.