Cloud computing refers to dynamically scalable infrastructure and virtualizes resources that allow the application to fulfil infinite demands with inexpensive and reliable services. Therefore, the service provider has to serve a large number of tasks. For elegant service to the tasks, there is a need for an efficient scheduling algorithm. Many algorithms have been developed for scheduling. However, most of the developed algorithm has conflicting objectives and its own limitation. Thus, one is efficient for one type of tasks at the same time inefficient to other kinds of tasks. In this paper, we have proposed a strategy which allocates the algorithms according to the type of task and reduces the conflicting objectives. We have analyzed a number of algorithms such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Max-Min, Min-Min. Finally, we have shown our proposed strategy which reduces the limitation of other algorithms, the tradeoff between the average waiting time and makespan.